Java 冒泡排序（優化版）

public void test(){
        int[] arr = {2,5,10,1,6};
        for (int i = 0; i < arr.length-1; i++) {
            boolean flag = false;
            int temp;
            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;//當位置發生改變，flag的值就發生變化
                }
            }
            System.out.println(Arrays.toString(arr));
            if(!flag) break;
        }
        System.out.println(Arrays.toString(arr));
    }