Java冒泡排序的实现以及优化

public class MaopaoDemo {
    public static void main(String[] args) {
        int[] list1 = {8,7,9,6,4,5,3,1,2,88,10};
//        int[] list1 = {1,2,3,4,5,6,7,8};
        for (int j = 0; j < list1.length - 1; j++){
            // 记录是否发生交换
            Boolean flag = false;
            for (int i = 0; i < list1.length - 1 - j; i++) {
                // 交换
                if (list1[i] > list1[i+1]){
                    int min = list1[i+1];
                    int max = list1[i];
                    list1[i] = min;
                    list1[i+1] = max;
                    flag = true;
                }
            }
            // 如果没有发生交换，程序结束！
            if(!flag){
                System.out.println("冒泡结束，最终结果为："+Arrays.toString(list1));
                break;
            }
            System.out.println("第"+j+"次冒泡，结果为："+Arrays.toString(list1));

        }

    }
}