Re^2: Which one is best for optimization

in reply to Re: Which one is best for optimization
in thread Which one is best for optimization

and the sort algorithm that takes O(n) time in the general case has yet to be invented

Well, but for this particular case, sorting numbers, it has already been invented!, it is called radix sort and there are at least two Perl implementations available from CPAN: Sort::Radix (pure perl) and Sort::Key::Radix (XS).

Comment on Re^2: Which one is best for optimization

Replies are listed 'Best First'.
Re^3: Which one is best for optimization by grinder (Bishop) on Sep 29, 2008 at 15:34 UTC
The whole point is that you don't need to sort! It's a net loss whichever way you cut it. • another intruder with the mooring in the heart of the Perl	[reply]

In Section Seekers of Perl Wisdom