public static void main(String[] args) {
int[] a = {5, 6, 3, 4, 8, 9, 13, 441, 8};
// function1(a);
function2(a);
}
public static void function1(int[] a) {
int count1 = 0;
for (int i = 0; i < a.length - 1; i++) {
for (int j = i + 1; j < a.length; j++) {
int temp;
if (a[i] > a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
count1++;
for (int m : a) {
System.out.print(m + " ");
}
System.out.println("");
}
}
System.out.println("第" + (i+1) + "次循环完成");
}
System.out.println("总共交换次数为"+count1+"次");
}
冒泡排序的两种写法
最新推荐文章于 2023-01-30 12:51:59 发布