Talk:Sorting algorithms/Sleep sort: Difference between revisions
Content added Content deleted
(a query on task requirement. -- ~~~~) |
(Yes, it is silly. I think it is supposed to be silly.) |
||
| Line 13: | Line 13: | ||
Negative numbers aren't that much of a strange animal to be sorted, and I can't see that any programmer will strain their back coding for such beasts. The little I know of most programmers, weak of back, strong of mind. -- [[User:Gerard Schildberger|Gerard Schildberger]] 19:02, 2 June 2012 (UTC) |
Negative numbers aren't that much of a strange animal to be sorted, and I can't see that any programmer will strain their back coding for such beasts. The little I know of most programmers, weak of back, strong of mind. -- [[User:Gerard Schildberger|Gerard Schildberger]] 19:02, 2 June 2012 (UTC) |
||
: This task not only specifies the end result -- that the numbers be sorted -- but the procedure for accomplishing that. Specifying the procedure is, as a general rule, bad practice, since the implementations are almost invariably inferior to what you get when you simply specify the desired results and consequences. It's done here, sometimes, I think for the humor value. Here, for example, a negative integer would require a negative delay -- the code would have to finish waiting before it started waiting. --[[User:Rdm|Rdm]] 21:08, 2 June 2012 (UTC) |
|||