Bogosort


In computer science, bogosort is a highly inefficient sorting algorithm based on the generate and test paradigm. The function successively generates permutations of its input until it finds one that is sorted. It is not useful for sorting, but may be used for educational purposes, to contrast it with more efficient algorithms.
Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input. An analogy for the working of the latter version is to sort a deck of cards by throwing the deck into the air, picking the cards up at random, and repeating the process until the deck is sorted. Its name is a portmanteau of the words bogus and sort.

Description of the algorithm

The following is a description of the randomized algorithm in pseudocode:
while not isInOrder:
shuffle
Here is the above pseudocode re-written in Python 3:

import random
def is_sorted -> bool:
"""Determine whether the data is sorted."""
return all
def bogosort -> list:
"""Shuffle data until sorted."""
while not is_sorted:
random.shuffle
return data

This code assumes that data is a simple, mutable datatype—like Python's built-in —whose elements can be compared without issue.
Here is an example with shuffle in Standard ML:

val _ = load "Random";
load "Int";
val rng = Random.newgen ;
fun select =
| select = let val = select in end
| select = raise Fail ;

fun shuffle xs =
let fun rtake _ =
| rtake ys max =
let val = select
in y :: rtake ys'
end
in rtake xs end;
fun bogosort xs comp =
let fun isSorted comp = comp <> GREATER andalso isSorted comp
| isSorted _ comp = true;
val a = ref xs;
in while do ; end;

Running time and termination

If all elements to be sorted are distinct, the expected number of comparisons performed in the average case by randomized bogosort is asymptotically equivalent to, and the expected number of swaps in the average case equals. The expected number of swaps grows faster than the expected number of comparisons, because if the elements are not in order, this will usually be discovered after only a few comparisons, no matter how many elements there are; but the work of shuffling the collection is proportional to its size. In the worst case, the number of comparisons and swaps are both unbounded, for the same reason that a tossed coin might turn up heads any number of times in a row.
The best case occurs if the list as given is already sorted; in this case the expected number of comparisons is, and no swaps at all are carried out.
For any collection of fixed size, the expected running time of the algorithm is finite for much the same reason that the infinite monkey theorem holds: there is some probability of getting the right permutation, so given an unbounded number of tries it will almost surely eventually be chosen.

Related algorithms

;: is a sorting algorithm introduced in the 2011 Google Code Jam. As long as the list is not in order, a subset of all elements is randomly permuted. If this subset is optimally chosen each time this is performed, the expected value of the total number of times this operation needs to be done is equal to the number of misplaced elements.
;: is an algorithm that was designed not to succeed before the heat death of the universe on any sizable list. It works by recursively calling itself with smaller and smaller copies of the beginning of the list to see if they are sorted. The base case is a single element, which is always sorted. For other cases, it compares the last element to the maximum element from the previous elements in the list. If the last element is greater or equal, it checks if the order of the copy matches the previous version, and if so returns. Otherwise, it reshuffles the current copy of the list and restarts its recursive check.
;: is another sorting algorithm based on random numbers. If the list is not in order, it picks two items at random and swaps them, then checks to see if the list is sorted. The running time analysis of a bozosort is more difficult, but some estimates are found in H. Gruber's analysis of "perversely awful" randomized sorting algorithms. O is found to be the expected average case.
;: is a pessimal sorting algorithm that is guaranteed to complete in finite time; however, there is no computable limit to the inefficiency of the sorting algorithm, and therefore it is more pessimal than the other algorithms described herein. The algorithm is based on a bad sorting algorithm,. The badsort algorithm accepts two parameters:, which is the list to be sorted, and, which is a recursion depth. At recursion level, merely uses a common sorting algorithm, such as bubblesort, to sort its inputs and return the sorted list. That is to say,. Therefore, badsort's time complexity is if. However, for any, first generates, the list of all permutations of. Then, calculates, and returns the first element of the sorted. To make truly pessimal, may be assigned to the value of a computable increasing function such as . Ergo, to sort a list arbitrarily badly, you would execute, where = number of elements in. The resulting algorithm has complexity, where = factorial of iterated times. This algorithm can be made as inefficient as we wish by picking a fast enough growing function.
;Slowsort: A different humorous sorting algorithm that employs a misguided divide-and-conquer strategy to achieve massive complexity.