Jump to content

Quantum sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Morwen (talk | contribs) at 14:41, 16 June 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This article is being considered for deletion in accordance with Wikipedia's deletion policy.
Please vote on and discuss the matter. See this article's entry on the Votes for Deletion page.

You are welcome to edit this article, but please do not blank, merge, or move this article, nor remove this notice, while the discussion is in progress. For more information, read the Guide to Votes for Deletion.

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 the many-worlds theory of 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, using the principle of quantum immortality to perform useful calculations. Hence, the algorithm has a linear and very quick performance - in theory. In practice this is not exactly possible.

See also

Retrieved from "https://en.wikipedia.org/w/index.php?title=Quantum_sort&oldid=15332365"