排序方式分類及冒泡具體實現
阿新 • • 發佈:2020-10-13
冒泡法具體實現:
public class SortTest {
public void sort(int[] args){
for(int m : args){
System.out.print("排序前 "+args[m]+" ");
}
int time1 = 0,time2 = 0;
for(int i = 0 ; i < args.length-1 ; i++){
++time1;
for(int j = i+1 ; j < args.length ; j++){
++time2;
int temp ;
if(args[i] > args[j]){
temp = args[j];
args[j] = args[i];
args[i] = temp;
}
}
}
System.out.println();
System.out.println("外迴圈次數:"+time1+"內迴圈次數:"+time2);
for(int n : args){
System.out.print("排序後 "+n+" ");
}
}
public static void main(String[] args) {
int[] arg = new int[]{2,1,4,5,8,7,6,3,9,0};
new SortTest().sort(arg);
}
}
執行結果
轉載於:https://blog.51cto.com/1137907860/1666108