On: Extremely simple sort algorithm with sub-cubic expected running time. [pdf]

[_cbsz]

my gut says this is ridiculous given that it's asymptotically slower than insertion sort, selection sort, and bubble sort and doesn't take advantage of cache (through sequential access) the way those algorithms do.

[codeodor → _cbsz]

I came to say the same. What could be simpler than the O(n^2) algorithms?