A. Pagaltzis wrote:
* John Stanton <[EMAIL PROTECTED]> [2006-10-09 19:35]:
Sorting data is time consuming, a physical law is involved. At
best it is an nlog(n) process.
Only when you sort by comparing elements with each other. Bucket
sort runs in O(n), f.ex. And quantum sort is O(1). ;-) Algorithms
that run faster than O(n log n) are very rarely practical,
however.
No, quantum sort is O(sqrt(n)) - much better than classical algorithms
but tough to implement and certainly not O(1) :)
Regards,
Arjen
