Lesson plan
Slowsort
Slowsort is a sorting algorithm. It is of humorous nature and not useful for practical applications. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis" (a parody of optimal algorithms and complexity analysis).
Article summary
Slowsort is a sorting algorithm. It is of humorous nature and not useful for practical applications. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis" (a parody of optimal algorithms and complexity analysis).
Key claims
- publication date: 1984 — source: Wikipedia, revision 1374390618, retrieved 2026-10-20 · confidence 0.95
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- The record states that the publication date is "1984". What evidence would count against this claim?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
- Wikipedia, “Slowsort”, revision 1374390618, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1374390618
Key claims and bibliography are generated from the same tracked claims and sources as the article page.