分享一个很有创意的排序算法:sleepSort 。巧妙利用了线程的sleep(),代码如下:
public class SleepSort {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
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) {
e.printStackTrace();
}
System.out.println(ms);
}
}
如果对算法的效率上有质疑,请留下高见。