java实现冒泡排序

// 数组的冒泡排序
    public static int[] getArrSort(int[] arr, boolean flag) {
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr.length -1; j++) {
                boolean isTrue = (flag && arr[j] < arr[j+1]) || (!flag && arr[j] > arr[j+1]);
                if(isTrue) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j+1] = temp;
                }
            }
        }
        return arr;
    }

调用一下

        public static int[] intArr = {11,222,3,5,3,7};
        boolean flag = true;
        int[] arr = getArrSort(intArr, flag);
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }

结果 // 222 11 7 5 3 3