Definition: A terribly inefficient sort algorithm that randomly swaps items until they are in order.
Generalization (I am a kind of ...)
sort algorithm, Las Vegas algorithm.
See also bogosort, stooge sort, permutation sort, lucky sort.
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.
Note: "Supercalifragilisticexpialidocious" is misspelled on the sixth page, although it is spelled correctly in the footnote.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 8 March 2021.
HTML page formatted Mon Mar 8 11:29:19 2021.
Cite this as:
Paul E. Black, "bozo sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 March 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/bozoSort.html