Sorting algorithms/Sleep sort: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: tabs->spaces; type sig; discussion) |
(added a tasks-based C# version of sleepsort) |
||
| Line 191: | Line 191: | ||
} |
} |
||
}</lang> |
}</lang> |
||
Alternative version using tasks: |
|||
<lang csharp>var input = new[] { 1, 9, 2, 1, 3 }; |
|||
foreach (var n in input) |
|||
Task.Run(() => |
|||
{ |
|||
Thread.Sleep(n * 1000); |
|||
Console.WriteLine(n); |
|||
}); |
|||
</lang> |
|||
Output, i.e. in LINQPad: |
|||
<pre>1 |
|||
1 |
|||
2 |
|||
3 |
|||
9</pre> |
|||
=={{header|Clojure}}== |
=={{header|Clojure}}== |
||