传说中的睡眠排序算法----

/**
 *睡眠排序法.....
 */
public class Test9 implements Runnable {

    private int num;
     public Test9(int num){
        this.num=num;
    }
    public void run(){
        try {
            Thread.sleep(num);
            System.out.println(num);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }
    public static void main(String[] args) {
     int[] nums={22,3213,1,1,3,99};
        for (int num1 : nums) {
            new Thread(new Test9(num1)).start();
        }
    }
}

传说中的睡眠排序法,感觉没什么问题啊☺,