Quantum sort

Quantum sort is a theoretical sort algorithm taking advantage of the multiple-universe theory.

In essence, one takes a random permutation of a set of elements. According to quantum mechanics, there will then exist a parallel universe in which the set of elements is sorted. One simply destroys all the universes where the set is not sorted. Hence, the algorithm has a linear and very quick performance - in theory. In practice this is not exactly possible.

See also

• Quantum algorithm
• Quantum computing

External Links

• bogo-sort in the Jargon File (with a discussion of Quantum sort)