升序冒泡排序和降序冒泡排序

1、升序冒泡排序

代码：

public class Test {
    public static void main(String[] args) {
        int[] arr = {3, 2, 1, 0};
        sort(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

    public static void sort(int[] keys) {
        boolean exchange = true;
        for (int i = 1; i < keys.length && exchange; i++) {
            exchange = false;
            for (int j = 0; j < keys.length - i; j++) {
                if (keys[j] > keys[j + 1]) {
                    int temp = keys[j + 1];
                    keys[j + 1] = keys[j];
                    keys[j] = temp;
                    exchange = true;
                }
            }
        }
    }
}

结果：

0
1
2
3

2、降序冒泡排序

代码：

public class Test {
    public static void main(String[] args) {
        int[] arr = {0, 1, 2, 3};
        sort(arr);
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

    public static void sort(int[] keys) {
        boolean exchange = true;
        for (int i = 1; i < keys.length && exchange; i++) {
            exchange = false;
            for (int j = 0; j < keys.length - i; j++) {
                if (keys[j] < keys[j + 1]) {
                    int temp = keys[j + 1];
                    keys[j + 1] = keys[j];
                    keys[j] = temp;
                    exchange = true;
                }
            }
        }
    }
}

结果：

3
2
1
0