Jump to content

Sorting algorithms/Sleep sort: Difference between revisions

Added jq
(Added Elixir)
(Added jq)
Line 712:
9
</pre>
 
=={{header|jq}}==
{{trans|Brainf***}}
 
Doesn't actually sleep. Instead, iterates reducing the values by one until each is zero.
 
<lang jq>echo '[5, 1, 3, 2, 11, 6, 4]' | jq '
def f:
if .unsorted == [] then
.sorted
else
{ unsorted: [.unsorted[] | .t = .t - 1 | select(.t != 0)],
, sorted: (.sorted + [.unsorted[] | .t = .t - 1 | select(.t == 0) | .v])} | f
end;
{unsorted: [.[] | {v: ., t: .}], sorted: []} | f | .[]'</lang>
{{out}}
<pre>1
2
3
4
5
6
11</pre>
 
 
=={{header|Julia}}==
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.