in reply to Returning the lowest key in a hash (or highest)

It's probably faster to iterate instead of sorting:
sub lowest_key (\%) { my @keys = keys %{ shift() }; my $low = $keys[0]; foreach(@keys) { $low = $_ if $_ < $low; } return $low; }