冒泡算法

冒泡算法

class Test {    public static void main(String[] args) {        int[] arr = {1, 8, 4, 7, 3, 9, 5, 2, 6, 0};        for (int i =0; i < arr.length - 1; i++) {            for (int j = 0; j < arr.length - i - 1; j++) {                if (arr[j] < arr[j + 1]) {                    int[] temp = arr[j];                    arr[j] = arr[ j+ 1];                    arr[j + 1] = arr[j];                }            }        }        System.out.println(Arrays.toString(arr));    }}