冒泡排序

public class MaoPaoSort {
    public static void main (String[] args) {
        int[] arr = {1,3,5,7,6};
        int temp=0;
        boolean flag=false;
        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]) {
                    temp=arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=temp;
                    flag=true;
                }
            }
            if (flag == false) {
                break;
            }
            else {
                flag=false;
            }
            for (int f : arr) {
                System.out.print(f+" ");
            }
            System.out.println();
        }

    }
}