冒泡排序

冒泡排序

public class Demo08 {
    public static void main(String[] args) {
        //冒泡排序：
        int[] a = {1, 6, 3, 9, 4, 3, 7, 50, 20, 60};
        //循环轮数 a.length-1
        for (int i = 0; i < a.length - 1; i++) {
            //每轮循环能得到最大值或最小值
            for (int j = 0; j < a.length - 1 - i; j++) {
                int b = 0;
                if (a[j] > a[j + 1]) {
                    b = a[j + 1];
                    a[j + 1] = a[j];
                    a[j] = b;
                }
            }
        }
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i]+" ");
        }
    }
}

执行结果：
1 3 3 4 6 7 9 20 50 60 
Process finished with exit code 0

冒泡排序

原文：https://www.cnblogs.com/zhangyaru/p/14916241.html