Live briefing
Everything about Slowsort
Humorous sorting algorithm
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. It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis". Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: SlowsortA 5-minute orientation
- Read the landmark paper: SlowSort: An Enhanced Sorting Algorithm for Large‐Scale Integer DatasetsCited 0 times
- Go sideways: SimplexityA closely related topic
- Go sideways: Interpolation sortA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Simplexity Simplexity is a neologism which proposes a possible complementary relationship between complexity and simplicity. One of the first formally published instances…
- Interpolation sort Interpolation sort (or histogram sort) is a sorting algorithm that uses an interpolation formula to divide and conquer. It is a variant of bucket sort…
- Affine arithmetic Affine arithmetic (AA) is a model for self-validated numerical analysis. In AA, the quantities of interest are represented as affine combinations (affine…
- Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
- Random coordinate descent Randomized (Block) Coordinate Descent Method is an optimization algorithm popularized by Nesterov (2010) and Richtárik and Takáč (2011). The first analysis…
- Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
- Smoothed analysis In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis…
- David Mount David Mount is a professor at the University of Maryland, College Park department of computer science whose research is in computational geometry. Mount…