Re: Efficient sorting

Hi

Martin York wrote:

> There are multiple sorts available (do a google on sorting
> algorithms), The most optimal sort is called a bucket sort. Under
> optimal conditions has a complexity of O(n).

However, I think that one should add that O(n) can only be achieved
because
bucket sort imposes restrictions on the input and that in general the
lower
bound is Omega(n log n).

Markus


-- 
      [ See http://www.gotw.ca/resources/clcm.htm
for info about ]
      [ comp.lang.c++.moderated.    First time posters: Do this! ]