java冒泡排序算法优化

public class jsonarraylear {
    public static final List<String> OLD_LIST = Arrays.asList("张三,李四,王五".split(","));

    public static void main(String args[]){
        int[] arr = new int[]{5,4,2,1,5};
        System.out.println("排序前：" + print(arr));
        sort(arr);
        sort1(arr);
        System.out.println("排序后：" + print(arr));
        System.out.println("----------------------------------------------------");
    }

    public static void sort(int[] arr){
        int len = arr.length -1;
        for(int i = 0;i<len;i++){
            for (int j=0;j<len-i;j++){
                if (arr[j] < arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1]  = temp;
                }
                System.out.print("第"+(i+1)+"轮，"+"第"+(j+1)+"次："+print(arr));
            }
            System.out.println("第"+(i+1)+"轮："+print(arr));
        }
    }

    public static void sort1(int[] arr){
        int len = arr.length - 1;
        boolean flag = true;
        for (int i=0;i<len;i++){
            for(int j=0;j<len-i;j++){
                if(arr[j]<arr[j+1]){
                    if(arr[j]<arr[j+1]){
                        int temp = arr[j];
                        arr[j] = arr[j+1];
                        arr[j+1] = temp;
                        flag = false;
                    }
                    System.out.println("第"+(i+1)+"轮，"+"第"+(j+1)+"次："+print(arr));
                }
                System.out.println("第"+(i+1)+"轮："+print(arr));
            }
            if(flag){
                break;
            }
        }
    }

    public static String print(int[] arr){
        return Arrays.stream(arr).mapToObj(String::valueOf).collect(Collectors.joining(","));
    }