|
|
|
| The stupid question is the question not asked | |
| PerlMonks |
Re^2: Which one is best for optimizationby salva (Canon) |
| on Sep 29, 2008 at 09:50 UTC ( [id://714297]=note: print w/replies, xml ) | Need Help?? |
|
and the sort algorithm that takes O(n) time in the general case has yet to be inventedWell, 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).
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||||||