in reply to a more efficient lexicographical sort?

try using Sort::Key, it is faster and uses less memory than both the ST and the GRT: 
use Sort::Key qw(keysort);

@sorted = keysort { pack "N*" => split /\./, $_ } @oids;

[download]

Replies are listed 'Best First'.
Re^2: a more efficient lexicographical sort?
by Anonymous Monk on Jan 19, 2006 at 17:30 UTC
    WOW !!! Much faster, around 50% percent faster and the memory footprint was 75% less.

    Thanks!

[reply]
      I think that you can make it even faster and less memory hungry encoding the oid numbers as unicode chars: 
      @sorted = keysort { pack "U*" => split /\./, $_ } @oids;

      [download]
[reply]
[d/l]

In Section Seekers of Perl Wisdom