Sleepsort is like a hash-based sort using sleep(x) instead of a hash function h(x). You can see more here: https://pages.cs.wisc.edu/~siff/CS367/Notes/sorting.

Sleepsort is like a hash-based sort using sleep(x) instead of a hash function h(x). You can see more here: https://pages.cs.wisc.edu/~siff/CS367/Notes/sorting.html https://pages.cs.wisc.edu/~siff/CS367/Notes/sorting.html The function h(x) places the item ordered directly into a table, instead of waiting x timesteps. The optimal choice of h(x), x ∈ X, is a bounded monotonic function that inverts the distribution of X, so that h(x) is uniformly distributed. It preserves the order and spreads h(x) evenly in the hash-space.