Surprising (for me) benchmark results...

John J. Lee phrxy at csv.warwick.ac.uk
Wed May 2 20:29:13 EDT 2001


[I wrote]
> There are O(N) sorting algorithms??  I thought that was restricted to
> quantum computation.
[...]

Actually, there is no quantum algorithm that works better than O(N ln N)
either.  There is a *search* that is better than the classical limit.


John





More information about the Python-list mailing list