package com.itranswarp.learnjava;

import java.util.Arrays;
import java.util.Collections;

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