冒泡排序
从前往后依次对相邻的元素两两比较,顺序错误就交换
将无序数组: 24, 69, 80, 57, 13, -1, 30, 200, -110 使用冒泡排序法将其排成一个从小到大的有序数列
public class BubbleSort {
public static void main(String[] args){
int[] arr = {24, 69, 80, 57, 13, -1, 30, 200, -110};
int temp = 0; //辅助交换的变量
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]){
temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
System.out.println("第"+(i+1)+"轮排序结果");
for (int j = 0; j < arr.length; j++){
System.out.print(arr[j]+"\t");
}
System.out.println();
}
System.out.println("排序后的数组如下");
for (int i = 0; i < arr.length; i++){
System.out.print(arr[i]+"\t");
}
}
}
结果: