冒泡排序的两种写法

int[] array = new int[]{5,1,3,9,4,8,7,0,6,2};

1.普通的冒泡排序

for (int i = 0; i < array.length; i++) {
  for (int j = 0; j < array.length - i - 1; j++) {
    if (array[j] > array[j+1]) {
      int temp = array[j];
      array[j] = array[j+1];
      array[j+1] = temp;
    }
  }
}

2.较易书写的冒泡排序【推荐使用】

for (int i = 0; i < array.length; i++) {
  for (int j = 0; j < i; j++) {
    if (array[i] < array[j]) {
      int temp = array[i];
      array[i] = array[j];
      array[j] = temp;
    }
  }
}