Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally poor time complexity. The lead states that its running time is slower than reasonable sorting algorithms and slower than bubble sort, a canonical example of a fairly inefficient sort, though it is more efficient than Slowsort. The name comes from The Three Stooges. It is mainly taught as a curiosity, an example of a correct algorithm that is deliberately or accidentally inefficient, useful for showing students how recursion can be correct and still expensive.
Facts
Time Complexity
Time Complexity (category)Polynomial Time -- O(n^k) 1 Connections
In Field
Source Stooge sort (Wikipedia)
Uses Design Technique
Source Stooge sort (Wikipedia)
Sources
1. Stooge sort (Wikipedia)
Lead section
Stooge sort is a recursive sorting algorithm.
Lead
It is notable for its exceptionally poor time complexity
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.