Talk:Sorting algorithms/Sleep sort: Difference between revisions
Content added Content deleted
(Designing for failure?) |
(→Designing for failure?: Don't worry) |
||
Line 2: | Line 2: | ||
Sleep gives a minimum duration to sleep, but not a maximum. This algorithm would thus sort incorrectly on a heavily loaded system. I cannot see a way to design a way around this without cheating on the algorithm. --[[User:Rdm|Rdm]] 15:14, 22 June 2011 (UTC) |
Sleep gives a minimum duration to sleep, but not a maximum. This algorithm would thus sort incorrectly on a heavily loaded system. I cannot see a way to design a way around this without cheating on the algorithm. --[[User:Rdm|Rdm]] 15:14, 22 June 2011 (UTC) |
||
:This is kinda just for fun. I wouldn't worry too much about it. --[[User:Mwn3d|Mwn3d]] 15:31, 22 June 2011 (UTC) |
Revision as of 15:31, 22 June 2011
Designing for failure?
Sleep gives a minimum duration to sleep, but not a maximum. This algorithm would thus sort incorrectly on a heavily loaded system. I cannot see a way to design a way around this without cheating on the algorithm. --Rdm 15:14, 22 June 2011 (UTC)
- This is kinda just for fun. I wouldn't worry too much about it. --Mwn3d 15:31, 22 June 2011 (UTC)