排序

1.冒泡排序

        int[] number = { 9, 8, 7, 6, 5, 4, 3, 2, 1 };
        int a;
        for (int i = 0; i < number.length; i++) {
            for (int s = 0; s < number.length-i-1; s++) {
                if (number[s] < number[s + 1]) {
                    a = number[s];
                    number[s] = number[s + 1];
                    number[s + 1] = a;
                }
            }
        }
        for (int s : number) {
            System.out.println(s);
        }