simultaneous multiple key sorting algorithm
Manfred Nowak
svv1999 at hotmail.com
Sun Jan 29 05:41:27 PST 2012
Manfred Nowak wrote:
> Population and sweep would each be linear in time.
The sweep is linear in time only, if the populatable points of the area
are bount by O(n), which is not neccessary the case.
Therefore, I don't see to find in the generell case a solution faster
than
O( n + k*log( k)),
where `n' is the number of elements of the input and `k' is the
predefined number of "best of the breed" to be sorted.
-manfred
More information about the Digitalmars-d
mailing list