public static void main(String[] args) {
int[] arr = {52, 62, 1, 3, 2, 75, 44, 15, 68, 42, 0, 5};
for (int n = arr.length - 1; n >= 0; n--) {
boolean flag = false;
for (int i = 0; i < n; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
flag = true;
}
}
if (flag == false) {
break;
}
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+" ");
}
}
最优时间复杂度O(N)
最差时间复杂度O(N^2)