算法之降序排序

public static void (String[] args)
{
 int a[] = {1,5,10,20,32,22,2,4,3,25};
   int tmp,i,j;
    for( i = 0; i<a.length-1; i++)
   {
        for( j =0; j<a.length-i-1; j++)
      {
            if(a[j]<a[j+1])
          {
                tmp = a[j];
              a[j] = a[j+1];
               a[j+1] = tmp;
            }
        }
    }
    for(i=0; i<a.length-1;i++)
   {
    System.out.println(a[i]);
    }
}

public static void (String[] args)
{
    int a[] = {1,5,10,20,32,22,2,4,3,25};
   int b[] = new int[10];
    int tmp,i,j,max;
    b[0] = a[0];
 for(i = 1;i<a.length;i++)
    {
        max = a[i];
      for(j = i-1; j>=0; j--)
      {
            if(max > b[j])
           {
                b[j+1] = b[j];
           }
            else
                break;
      }
        b[j+1] = max;
    }
    for(i=0;i<b.length;i++)
  {
        System.out.println(b[i]);
    }

}