(algorithm)
Definition: A terribly inefficient sort algorithm that randomly swaps items until they are in order.
Generalization (I am a kind of ...)
Las Vegas algorithm.
See also bogosort, stooge sort, lucky sort.
Note:
Run time analysis in
Hermann Gruber, Markus Holzer, and Oliver Ruepp, Sorting the slow way: An analysis of perversely awful randomized sorting algorithms, FUN 2007, LNCS 4475, pp. 183-197, 2007. Available at http://www2.tcs.ifi.lmu.de/~gruberh/data/fun07-final.pdf
Note: "Supercalifragilisticexpialidocious" is misspelled on the sixth page, although it is spelled correctly in the footnote.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 8 September 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "bozo sort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 8 September 2009. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bozoSort.html