冒泡排序法

n个数

比较轮次从 1 递增到 n-1 ；

轮次肯定是越来越多啊，所以递增到n-1

每轮比较次数从 n-1 递减到 1

越到后面，每轮比较的次数肯定是越来越少啊，所以从 n-1 递减到 1

public class test{
    public static void main(String[] args) {
        int[] ints = new int[6];
        ints[0] = 10;
        ints[1] = 1123;
        ints[2] = 12;
        ints[3] = 1;
        ints[4] = 1000;
        ints[5] = 12321;
        for(int i = 1;i < ints.length;i++){
            for(int j = 0;j< ints.length-i;j++){
                if(ints[j]<=ints[j+1]){
                    int temp = ints[j];
                    ints[j] = ints[j+1];
                    ints[j+1] = temp;
                }
            }
        }
        for(int q = 0;q< ints.length;q++){
            System.out.println(ints[q]);;
        }
    }
}