Java冒泡法排序实例

public class TestBubbleUp {

 

     /* 冒泡排序算法 */ 

     public static int[] sort(int[] m) 

     { 

         int theLenth = m.length; 

         /*执行theLenth次*/ 

         for (int i = 0; i < theLenth; i++) 

         { 

             /*每执行一次，将最小的数排在后面*/ 

             for (int j = 0; j < theLenth - i - 1; j++) 

             { 

                 int a = m[j]; 

                 int b = m[j + 1]; 

                 if (a < b) 

                 { 

                     m[j] = b; 

                     m[j + 1] = a; 

                 } 

             } 

         } 

         return m; 

     } 



     public static void main(String args[]) 

     { 

         int[] m = 

         { 0, 1, 9, 13, 27, 39, 88, 100 }; 

         int[] n = sort(m); 

         for (int i = 0; i < m.length; i++) 

         { 

             System.out.println(n[i] + "/n"); 

         }        

     } 

}