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

demonstration and source code (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 29 September 2014.
HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:
Paul E. Black, "stooge sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 29 September 2014. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/stoogesort.html