Anonymous user
Sorting algorithms/Sleep sort: Difference between revisions
m
→{{header|Icon}} and {{header|Unicon}}
No edit summary |
|||
Line 364:
The following solution only works in Unicon.
<lang unicon>
every insert(t:=set(),mkThread(t,!A))▼
▲ every insert(t,mkThread(!A))
every spawn(!t) # start threads as closely grouped as possible
while (*t > 0) do write(<<@)
end
procedure mkThread(t,n) # 10ms delay scale factor
return create (delay(n*10),delete(t,¤t),n@>&main)
end</lang>
|