Java语言基础-11.冒泡排序

for(int i=0;i<arr.length-1;i++){
boolean isSwap = false;
for(int j=0;j<arr.length-i-1;j++){
if(arr[j]>arr[j+1]){
int t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
isSwap = true;
}
}
if(!isSwap){break;}
System.out.println(Arrays.toString(arr));
}

for(int i=0;i<arr.length-1;i++){
boolean isSwap = false;
for(int j=arr.length-1;j>i;j--){
if(arr[j]<arr[j-1]){
int t = arr[j];
arr[j] = arr[j-1];
arr[j-1] = t;
isSwap = true;
}
}
if(!isSwap){break;}
System.out.println(Arrays.toString(arr));
}