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).