main = do
sleepsort [1, 5, 3, 7, 8, 5, 3, 2, 6, 1, 6]
threadDelay 10000000
Name:
Anonymous2011-06-16 4:54
I heartily disagree with all the attempts to downplay the brilliance of the sleep sort algorithm. Many of you have missed the important point that while traditional sorting algorithms can only utilize one core, sleep sort has the capacity to use the full power of a massively parallel execution environment.
Given that you need nearly no computing in each of the threads, you can implement them using low-power CPUs, so this is in fact a GREEN COMPUTING algorithm.
Oh, and did I mention that the algorithm can also run inside a cloud...?
Sure, you're a genius!
Name:
Anonymous2011-06-16 4:55
Isn't this something GPGPUs are made for?
Name:
Anonymous2011-06-16 4:57
How about adding the n time that is needed to iterate through all elements and then cut sleep time like $1/1000, it will complete with 1000 times faster ??
Kudos guise!!! I don't quite understand the details of this program, but I like the name. Will blog it. DESUDESUDESU Oh and I can't believe I'm on 4chan for 2 whole years and never heard of text boards before! PUDDI PUDDI!
>>236 Incidentally, what makes this algorithm really interesting is that there actually exist real-life applications. For instance, DNA sequencing (Sanger sequencing) depends on something like this to sort DNA fragments according to their length (and more generally, every electrophoresis does something similar). The difference is that sequencing is performed physically, not in a computer.