import java.util.Arrays;
public class list {
public static void main(String[] args) {
int arr[] = {4,10,-2,11,-3};
// 冒泡排序时间复杂度o(n^2)
int temp = 0; // 临时变量
boolean flag = false; //标识变量,表示是否进行交换
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if (arr[j] > arr[j+1]){
flag = true;
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
System.out.println("第"+(i+1)+"次排序后的数组");
System.out.println(Arrays.toString(arr));
if (!flag){
break;
}else {
flag = false; //重置flag 进行下次判断
}
}
}
}