xkcd2

Linear Sort

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