Here's an example of sorting by key using recursion.
#!/usr/bin/perl -Tw
#
# Multi-level hash sort
use strict;
use warnings;
my %timing1 = initmyhash();
printsortedhash (\%timing1, '');
exit;
sub initmyhash {
# Obviously, put whatever sets up your hash here.
return ( dog => 'rover', cat => { name => 'sandy', age => 10 } );
}
sub printsortedhash {
my ($this, $report) = @_;
for my $key (sort keys %$this) {
if (ref $this->{$key} eq 'HASH') {
printsortedhash ($this->{$key}, $report . "\t $key")
} else {
print $report . "\t $key\t $this->{$key}\n";
}
}
}
The FAQ linked above shows how to sort by value instead/also. Take your pick.