xkcd #3026: Linear Sort

The best case is O(n), and the worst case is that someone checks why.

https://explainxkcd.com/3026/