December 9th, 2009

Pessimal Algorithms and Simplexity Analysis

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms.

Andrei Broder and Jorge Stolfi
DEC Systems Research Center
130 Lytton Avenue, Palo Alto CA 94301


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

via nponeccop, http://nponeccop.livejournal.com/163432.html, via nivanych