public class 冒泡排序 { /** * sample maopao sort * @param num */ public static int[] sort(int[] num) { int middle; int[] returnNum=new int[num.length]; for(int i=0;i<num.length;i++) { returnNum[i]=num[i]; } for(int i=0;i<returnNum.length;i++) { for(int j=i+1;j<returnNum.length;j++) { if(returnNum[i]>returnNum[j]) { middle=returnNum[i]; returnNum[i]=returnNum[j]; returnNum[j]=middle; } } } return returnNum; }
//复杂的冒泡排序 public static int[] sortComplex(int[] num) { int middle; int[] returnNum=new int[num.length]; for(int i=0;i<num.length;i++) { returnNum[i]=num[i]; } for(int i=0;i<returnNum.length;i++) { for(int j=0;j<returnNum.length-1-i;j++) { if(returnNum[j]>returnNum[j+1]) { middle=returnNum[j+1]; returnNum[j+1]=returnNum[j]; returnNum[j]=middle; } } } return returnNum; }
//简单的冒泡排序 public static void main(String[] args) { int[] test={1,6,7,20,2,5}; int[] returnNums=sortComplex(test); for(int num:returnNums) { System.out.println(num); } } }