// 降序排序import java.util.Arrays;

public class ReverseSort {
    public static void main(String[] args) {
        int[] ns = { 28, 12, 89, 73, 65, 18, 96, 50, 8, 36, 67};
        // 排序前:        System.out.println("排序前：\n"+Arrays.toString(ns));
        // TODO:        Arrays.sort(ns);
            int temp;
            for(int i=0;i<ns.length/2;i++){
                temp = ns[i];
                ns[i] = ns[ns.length-i-1];
                ns[ns.length-i-1] = temp;
            }

        // 排序后:        System.out.println("排序后：\n"+Arrays.toString(ns));
        if (Arrays.toString(ns).equals("[96, 89, 73, 67, 65, 50, 36, 28, 18, 12, 8]")) {
            System.out.println("测试成功");
        } else {
            System.out.println("测试失败");
        }
    }
}