Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re: Twice the pleasure of sorting a hash

by broquaint (Abbot)
on Apr 26, 2004 at 09:52 UTC ( #348121=note: print w/ replies, xml ) Need Help??


in reply to Twice the pleasure of sorting a hash

A double comparison should do it e.g

my %h = ( rock => 3, candle => 25, bug => 3, rain => 12, dust => 17, spider => 12, ); for( sort { $h{$b} <=> $h{$a} || $a cmp $b } keys %h ) { print "$_ => $h{$_}\n"; } __output__ candle => 25 dust => 17 rain => 12 spider => 12 bug => 3 rock => 3
So firstly we sort by value in descending order then optionally sort by key value.
HTH

_________
broquaint


Comment on Re: Twice the pleasure of sorting a hash
Download Code
Re: Re: Twice the pleasure of sorting a hash
by coldfingertips (Pilgrim) on Apr 26, 2004 at 09:55 UTC
    That works perfectly, you're the best!! Thanks so much for your help broquaint!!

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (4)
As of 2015-07-07 04:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (87 votes), past polls