Jump to content

Quantum sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Carnildo (talk | contribs) at 02:57, 30 June 2005 (Removed the hoax/joke, improved the wording of the resulting stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A quantum sort is any sort algorithm that runs on a quantum computer. Such an algorithm would be faster than any existing sort algorithm by a linear factor, but no such algorithm has actually been implemented.

See also