Definition: A terribly inefficient sort algorithm that swaps the top and bottom items if needed, then (recursively) sorts the bottom two-thirds, then the top two-thirds, then the bottom two-thirds again.
See also bozo sort, bogosort, lucky sort.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 29 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "stooge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 29 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/stoogesort.html