package csdn2;
import java.util.Arrays;
/**
* 冒泡排序
* @author Babulakaka
* @create 2021-06-13 20:47
*/
public class BubbleSort {
public static void main(String[] args) {
int[] arr = new int[]{1, -10, 25, -1, 5, 3};
System.out.println("排序前");
System.out.println(Arrays.toString(arr));
System.out.println("排序后");
int temp;
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;//如果进行交换则flag变为true
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
if(flag){
System.out.println("第"+(i+1)+"趟排序:");
System.out.println(Arrays.toString(arr));
flag=false;
}else {
break;
}
}
}
}
07-29
07-29
07-29
07-29