Unless the "hashes" are actually tied or overloaded objects with really slow access times, I expect moritz's much simpler sort { $a->{size} <=> $b->{size} } will also be faster (but I'm ready to be corrected).
In reply to Re^2: How to sort by the key value of an Array of Hash structure?
by kyle
in thread How to sort by the key value of an Array of Hash structure?
by Jordy224
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |