Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Re^2: Sorting keys of hash table by values

by rjray (Chaplain)
on Jan 31, 2008 at 22:28 UTC ( #665466=note: print w/replies, xml ) Need Help??

in reply to Re: Sorting keys of hash table by values
in thread Sorting keys of hash table by values

Bad. reverse means extra operations and making a second list that is the same size as the original.

The first reply is the best, as it does not involve any extra operations.


  • Comment on Re^2: Sorting keys of hash table by values

Replies are listed 'Best First'.
Re^3: Sorting keys of hash table by values
by kyle (Abbot) on Feb 01, 2008 at 02:40 UTC

    I thought you might say that (and by "you", I mean "somebody").

    use Benchmark qw( cmpthese ); use List::Util qw( shuffle ); my @set = shuffle 1 .. 1_000_000; cmpthese( 100, { 'sort' => sub { my @x = sort { $b <=> $a } @set; return; } +, 'rsort' => sub { my @x = reverse sort { $a <=> $b } @set; +return; }, } ); __END__ Rate sort rsort sort 1.01/s -- -2% rsort 1.03/s 2% --

    (As I recall, 2% is within the margin of error for Benchmark.)

    In perl (the implementation of Perl), there's a special case for reverse sort so that it doesn't have the performance penalty you might otherwise expect it to have. That being the case, the main difference between reverse sort { $a cmp $b } and sort { $b cmp $a } is how they read to the programmer. I think that it's far more obvious what's going on when you reverse sort especially as the expressions involved become more complicated. It could be pretty easy to lose the $a and $b in a big block. Even if it were not optimized, I think you'd have to have a pretty long list before the performance penalty outweighs the maintainability benefit.

    This also means there's no performance penalty for reverse sort { $b <=> $a }, but that's just rude.

Re^3: Sorting keys of hash table by values
by lidden (Curate) on Jan 31, 2008 at 22:34 UTC
    Did you try it?
    I thought that too but testing samtregar and kyles versions took the same time. Ikegamis version is about 6% slower.

      How did you test it? What size(s) of hash tables? How many iterations? Particularly if the hash table is small, the differences could be swallowed up by variations in the O/S CPU scheduling and other tasks running at the same time.


        2000 and 5000 keys, 1000 and 3000 iterations.


Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://665466]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (3)
As of 2022-05-29 05:12 GMT
Find Nodes?
    Voting Booth?
    Do you prefer to work remotely?

    Results (101 votes). Check out past polls.