Perl hashes are by definition unordered so you can't sort them*. As you've been given answers you can get a sorted list of the keys based on deep values, but you're not doing anything to the hash itself.
</nitpick mode="pedantic">
(*) Unless you're monkeying with tie (e.g. Tie::Hash::Sorted), in which case you're strictly speaking not dealing with plain perl hashes any more.
The cake is a lie.
The cake is a lie.
The cake is a lie.
In reply to Re: Sorting hash on deep value
by Fletch
in thread Sorting hash on deep value
by Stickybit
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |