Re:Bubblesort, rocksort, and cocktail-shaker sort
by ironmagma on Wednesday December 16, 2020 @09:19AM
(#25442732)
Computationally, this (ab)uses the scheduler to do your sorting for you. So really the performance becomes whatever your scheduler’s performance is, probably heapsort time (O(n log n)).
for x in "$@"; do (sleep $x; echo $x) &; done