(algorithm)
Definition: A terribly inefficient sort algorithm that repeatedly generates a random permutation of the items until the items are in order.
See also bozo sort, stooge sort, lucky sort.
Note: From the slang "bogus" meaning "bad" as in "I can't believe anybody would be so thoughtless to write/do/say/believe that, and I just can't let it pass without objecting." See the FOLDOC entry for bogo-sort.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 5 December 2005.
HTML page formatted Mon Sep 11 09:46:01 2006.
Cite this as:
Paul E. Black, "bogosort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 5 December 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/bogosort.html
