0
采纳
冒泡排序:依次比较相邻的两个数,将小数放在前面,大数放在后面,时间复杂度为O(n^2)
import java.util.Arrays;
public class MyCalculator {
public static void main(String[] args) {
int[] arr = {25, 24, 12, 76, 101, 96, 28};
sortFinal(arr);
}
private static void sortFinal(int[] arr) {
boolean sorted = true;
for (int j = 0; j < arr.length - 1; j++) {
sorted = true;
System.out.println("第" + (j + 1) + "趟");
for (int i = 0; i < arr.length - 1 - j; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
sorted = false;
}
System.out.println("第" + (i + 1) + "次" + Arrays.toString(arr));
if (sorted) {
break;
}
}
}
}
}