importjava.util.Scanner;//数组的冒泡排序:输入有限个数的整数,对该整数数组进行冒泡排序,升序排序,并输出//冒泡排序:每一轮选出最大的数放在最后publicclassArrayBubbleSort{publicstaticvoidmain(String[] args){System.out.println("请输入你需要输入的整数个数");Scanner sc =newScanner(System.in);int number = sc.nextInt();int[]Array=newint[number];for(int i =0; i <Array.length; i++){System.out.println("请输入你需要排序的整数");Array[i]= sc.nextInt();}System.out.println("所以你需要排序的整数为:");for(int i =0; i <Array.length; i++){System.out.print(Array[i]+"\t");}for(int i =1; i <Array.length; i++){//轮数Array.length-1for(int j =0; j<Array.length-i;j++){//每轮比较的次数if(Array[j]>Array[j+1]){//升序排序int temp;
temp =Array[j+1];Array[j+1]=Array[j];Array[j]= temp;}}}System.out.println("\n"+"冒泡排序后升序的结果为");for(int i =0; i <Array.length; i++){System.out.print(+Array[i]+"\t");}}}