/**
 * 睡觉排序法
 * 
 * @author z77z
 *
 */

public class SleepSort {
	public static void main(String[] args) {
		int[] ints = { 1, 4, 7, 3, 8, 9, 2, 6, 5 };
		SortThread[] sortThreads = new SortThread[ints.length];
		for (int i = 0; i < sortThreads.length; i++) {
			sortThreads[i] = new SortThread(ints[i]);
		}
		for (int i = 0; i < sortThreads.length; i++) {
			sortThreads[i].start();
		}
	}
}

class SortThread extends Thread {
	int ms = 0;

	public SortThread(int ms) {
		this.ms = ms;
	}

	public void run() {
		try {
			sleep(ms * 10 + 10);
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		System.out.println(ms);
	}
}