Java 冒泡排序 优化完毕后的案例

public class test {
    public static void main(String[] args) {
        int[] arr = {-1, 0, 0, 0, 12, 12, 45, 12, 13, 11, 23, 77, 0};
        bubbleSort(arr);
    }

    static void printArr(int[] arr) {
        for (int value : arr) {
            System.out.print(value + " ");
        }
    }

    static void bubbleSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            int cnt = 0;
            for (int j = 0; j < arr.length - 1 - i; j++) {
                if (swap(arr, j, j + 1)) {
                    cnt = 1;
                }
            }
            if (cnt == 0) {
                break;
            }
            System.out.println("\n遍历" + i + "次的数组：");
            printArr(arr);
        }
        System.out.println("\n\n");
        printArr(arr);
    }

    static boolean swap(int[] arr, int pre, int after) {
        if (arr[pre] > arr[after]) {
            int temp = arr[pre];
            arr[pre] = arr[after];
            arr[after] = temp;
            return true;
        }
        return false;
    }
}