NIST

stooge sort

(algorithm)

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.

Author: PEB

Implementation

Pat Morin's implementation (Java).
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 January 2021.
HTML page formatted Tue Jan 19 08:57:16 2021.

Cite this as:
Paul E. Black, "stooge sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 January 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/stoogesort.html