一些排序算法的使用

冒泡算法

1. public class test2 {
   public static void main(String[] args) {
      int[] num = { 80, 50, 42, 42, 66, 99 };
      num(num);
   }
   
   public static void num(int[] num) {
      int count = num.length;
   
      for (int i = 0; i < (count - 1); i++) {
          for (int j = 0; j < (count - 1 - i); j++) {
              if (num[j] > num[j + 1]) {
                  num[j] = num[j] + num[j + 1];
                  num[j + 1] = num[j] - num[j + 1];
                  num[j] = num[j] - num[j + 1];
              }
          }
      }
   
      for (int value : num) {
          System.out.println(value);
      }
    }
   }
   

插入排序算法

2

  public class test3 {
  public static void main(String[] args) {
    int[] nums = { 80, 50, 42, 7, 66, 99 };

    for (int i = 1; i < nums.length; i++) {
        int temp = nums[i];
        int j = 0;

        for (j = i - 1; j >= 0; j--) {
            if (temp < nums[j]) {
                nums[j + 1] = nums[j];
            } else {
                break;
            }
        }

        if (nums[j + 1] != temp) {
            nums[j + 1] = temp;
        }
    }

    for (int n : nums) {
        System.out.println(n);
    }
 }
 }