彻底解决冒泡排序
图解更清晰
代码实现:
public class Paixu {
public static void main(String[] args) {
int a[] = { 1, 15, 34, 28, 5, 3 };
for (int i = 0; i < a.length - 1; i++) {
for (int j = 0; j < a.length - 1 - i; j++) {
if (a[j] > a[j + 1]) {
int mid;
mid = a[j + 1];
a[j + 1] = a[j];
a[j] = mid;
}
}
}
for (int i : a) {
System.out.print(" " + i);
}
}
}