Re: Too Many Packages [was Re: Splitting locales...]
On Mon, Oct 09, 2000 at 06:05:52PM -0400, Buddha Buck wrote:
> > On Mon, Oct 09, 2000 at 08:35:07AM -0500, David Starner wrote:
> > Sorting strings of bounded length is O(n).
> Because a proper analysis of radix sort will say that sorting n strings
> is O(n*m), where m is the length of the strings
strings bounded ~ m fixed : O(n*m) = O(n)
> So for arbitrary length strings, you have O(n log n).
You are in complete agreement. You even proofed his point. Thanks for the
explanation :)
Marcus
--
`Rhubarb is no Egyptian god.' Debian http://www.debian.org Check Key server
Marcus Brinkmann GNU http://www.gnu.org for public PGP Key
Marcus.Brinkmann@ruhr-uni-bochum.de, marcus@gnu.org PGP Key ID 36E7CD09
http://homepage.ruhr-uni-bochum.de/Marcus.Brinkmann/ brinkmd@debian.org
Reply to: