这方法好Low啊。。。

package com.itranswarp.learnjava;

import java.util.Arrays;

/** * 降序排序 */
public class Main {
   public static void main(String[] args) {
      int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36 };
      // 排序前:      
      Arrays.sort(ns);
      System.out.println(Arrays.toString(ns));
      // TODO:      
      int[] a = new int[ns.length];
      for(int i = 0; i < ns.length; i++){
         a[i] = ns[ns.length - i - 1];
      }
      // 排序后:      
      System.out.println(Arrays.toString(a));
      if (Arrays.toString(a).equals("[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]")) {
         System.out.println("测试成功");
      } else {
         System.out.println("测试失败");
      }
   }
}

结果：

[8, 12, 18, 28, 36, 50, 65, 73, 89, 96]
[96, 89, 73, 65, 50, 36, 28, 18, 12, 8]
测试成功