冒泡算法

 1 package test;
 2 
 3  class  test{
 4      public static void main(String args[])
 5      {
 6          int[] a={8,1,3,4,5,3,7,3,4,1};
 7          for(int i = 0;i<a.length;i++)
 8              for (int j = i+1; j <a.length ; j++) {
 9                 if (a[i]<=a[j]) {
10                     int m =a[i];
11                     a[i] = a[j];
12                     a[j] = m;
13                 }
14             }
15          for(int i:a)
16          {
17              System.out.printf(" "+i);
18          }
19      }
20  }

 8 7 5 4 4 3 3 3 1 1