Name:
Anonymous
2011-03-30 15:08
It seems like an ideal language to implement sleepsort in.
Name:
Anonymous
2011-03-30 15:21
delay x -> spawnThread {-> sleep x -> say x}
sleepSort xs -> map delay xs
the nice part about sleep sort is that it has only O(n) space/time complexity
Name:
Anonymous
2011-03-30 15:26
BTW, sleep sort is just a version of radix sort.
Name:
Anonymous
2011-03-30 15:43
sleepSort [1,2,3,∞]
WILL THIS PROGRAM HALT?
Name:
Anonymous
2011-03-30 20:27
>>46
Infinite values can only be Fibonacci buttsorted
Name:
Anonymous
2011-03-30 23:36
>>46
It will if a logistic function is used on inputs.
Name:
Anonymous
2011-09-19 15:22
>>46
The compiler would optimize it to
[0x01, 0x02, 0x03, 0x04].