Here's a sorting algorithm with a similar idea of assuming a random input and applying an idea from hashing (but instead of buckets, it's robin-hood hashing): h

Here's a sorting algorithm with a similar idea of assuming a random input and applying an idea from hashing (but instead of buckets, it's robin-hood hashing): https://github.com/mlochbaum/rhsort https://github.com/mlochbaum/rhsort Unlike this post though, it's got proper comparisons against the best C implementations of other algorithms, and is aware that, as most inputs aren't entirely random, its use is very limited.