java冒泡排序（最精简代码）

public class BubbleSort {
public void bubbleSort(int[] array) {
int temp;
boolean flag = true;
for (int i = 0; i < array.length - 1 && flag == true; i++) {// 比较时为i<array.length-1，因为有两个数在比较
flag = false;
for (int j = 0; j < array.length - i - 1; j++) {
if (array[j] > array[j + 1]) {// 如果要从大到小排序只需改变此处顺序即可
temp = array[j + 1];
array[j + 1] = array[j];
array[j] = temp;
flag = true;
}
}
// 打印每趟排序结果
for (int m = 0; m <= array.length - 1; m++) {// 输出时为i<=array.length-1
System.out.print(array[m] + "\t");
}
System.out.println();
}
}

public static void main(String[] args) {
BubbleSort bubbleSort = new BubbleSort();
int[] array = { 5, 69, 12, 3, 56, 789, 2, 5648, 23 };
bubbleSort.bubbleSort(array);
System.out.println("排序后结果为：");
for (int i = 0; i <= array.length - 1; i++) {// 输出时为i<=array.length-1
System.out.print(array[i] + "\t");
}
}
}