Java 冒泡排序的实现

 1 //Bubble Sort
 2     public static void BubbleSort(int[] obj){    
 3         for(int i =0;i<obj.length-1;i++){  //最多需要n-1趟排序
 4             for(int j = 0; j<obj.length-i-1;j++){   //对obj[0,...,n-i-1],此时j的范围逐渐在减小
 5                 if(obj[j]<obj[j+1]){   //把小的值交换到后面  
 6                     int temp = obj[j];
 7                     obj[j] = obj[j+1];
 8                     obj[j+1] = temp;
 9                 }
10             }
11         }
12         for(int i:obj){
13             System.out.print(i+" ");
14         }
15     }