Re: Twice the pleasure of sorting a hash

[broquaint]

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.

[coldfingertips]

That works perfectly, you're the best!! Thanks so much for your help broquaint!!