[catwell]

This is a slightly simpler (because of unicity) version of bucket sort or counting sort.

[sli]

I remember seeing a (gag) variation of counting sort that just provided each element as an argument to `sleep`.

[shitlord]

Yup, sleep sort: https://rosettacode.org/wiki/Sorting_algorithms/Sleep_sort

[tylerhou]

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.

[OldHand2018]

Brilliant!

Although if it took a long time to enumerate the list of elements…

[ballenf]

Pass them in as milliseconds or nanoseconds?