package demo3;
/*
* 冒泡排序
*/
public class maopao {
public static void main(String[] args) {
int[] arr={9,8,3,4,6,5};
System.out.print("原数组元素");
for (int i=0;i<arr.length;i++){
System.out.print(arr[i]+"\t");
}
System.out.println();
System.out.println("冒泡排序");
//外层是轮数
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]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
//遍历输出排序后结果
System.out.print("新数组元素");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+"\t");
}
}
}