public static void bubble_v2(int[] a) {
int n = a.length - 1;
while (true) {
int Last = 0; // 表示最后一次交换索引位置
for (int i = 0; i < n; i ++) {
if (a[i] > a[i + 1]) {
int t = a[i];
a[i] = a[i + 1];
a[i + 1] = t;
last = i;
}
n = last;
if (n == 0) {
break;
}
}
冒泡排序~~~
于 2023-03-04 23:14:47 首次发布