Re^2: a more efficient lexicographical sort?

WOW !!! Much faster, around 50% percent faster and the memory footprint was 75% less.

Thanks!

Comment on Re^2: a more efficient lexicographical sort?

Replies are listed 'Best First'.
Re^3: a more efficient lexicographical sort? by salva (Canon) on Jan 19, 2006 at 18:24 UTC
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]