I remember seeing a (gag) variation of counting sort that just provided each element as an argument to `sleep`.
Brilliant!
Although if it took a long time to enumerate the list of elements…
Pass them in as milliseconds or nanoseconds?
That’s more like heapsort, because the OS will use a heap to implement a priority queue that contains times for when the next process needs to be scheduled.