ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting

Mikkel Abrahamsen

We introduce the algorithm ExpoSort, a groundbreaking method that sorts an array of $n$ numbers in a spectacularly inefficient $\Theta (2^n)$ time. ExpoSort proudly claims the title of t…