Re: Too Many Packages [was Re: Splitting locales...]
William Lee Irwin III wrote:
> Those lower bounds on sorting are incorrect. Bucket sorting and
> radix sorting can reduce the sorting time to O(n), given appropriate a
> priori information about the sorting keys (either a bounded space for
> radix sort, or a rough distribution for an unbounded space; the bound
> on bucket sorting is actually the expected sorting time).
Yes, and the sphagetti sort is O(1) (with a O(n) setup though ;-).
Some sorts arn't particularly practical though.
--
see shy jo
Reply to: