Quantum sort
This article may meet Wikipedia's criteria for speedy deletion because: No source listed. No source found when I searched. This is a dictionary definition with an unprovable assertion as the Quantum computer does not exist and the Quantum algoritm does not exist.. For valid criteria, see CSD.
If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message. Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.
Note to administrators: this article has content on its talk page which should be checked before deletion. Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.This page was last edited by WAS 4.250 (contribs | logs) at 11:44, 17 June 2007 (UTC) (17 years ago) |
A quantum sort is any sorting algorithm that runs on a quantum computer. Such an algorithm could at best be linearly faster than any existing sort algorithm (if based on comparisons like classical algorithms), but no such algorithm has actually been implemented.
See also
- Bogosort, a sorting algorithm with a joke quantum implementation