[seqfan] Slow Sort

[Victor Miller]

Ron Hardin said

> Only semi-related, there was a contest at work once to come up with the
slowest
 > sort algorithm.

I don't remember the contest, but the following paper (which is good for a
lot of laughs) "Pessimal Algorithms and Simplexity Analysis" gives a
sorting algorithm which is exponential in the best case.

Victor

http://www.cs.uiuc.edu/class/fa05/cs473ug/resources/pessimal-algorithms.pdf