Randomly swap elements in the list until it's sorted. Thought by some to be the single most inefficient sort one can implement, but this turns out not to be the case; see http://home.tiac.net/~cri_d/cri/2001/badsort.html (for example, generating random permutations of the list until it's sorted is O(N!))
Also known as the **Random****Sort**.

Ironically, a variant of the BogoSort can sort any list in O(1). See QuantumBogoSort.

- "The archetypical perversely awful algorithm".

Ironically, a variant of the BogoSort can sort any list in O(1). See QuantumBogoSort.

EditText of this page (last edited May 26, 2011) or FindPage with title or text search