Re^3: What are the other option for sorting the keys of hash of hashes

Do you have actual performance problems? If not, don't worry about it. And if you have performance problems, profile your code first to find out which parts of the code consume the most time.

In case of many items the hash lookups can be reduced with a Schwartzian Transform, but it will eat more memory in turn, and likely to only give you a small speedup, if any.

Comment on Re^3: What are the other option for sorting the keys of hash of hashes

Replies are listed 'Best First'.
Re^4: What are the other option for sorting the keys of hash of hashes by luckypower (Beadle) on Sep 29, 2008 at 11:34 UTC
moritz, i dont have any performance problem.... This is just for knowledge.... thanks	[reply]
Re^5: What are the other option for sorting the keys of hash of hashes by salva (Canon) on Sep 29, 2008 at 11:45 UTC
then, read the paper A Fresh Look at Efficient Perl Sorting by Uri Guttman and Larry Rosler, for an explanation of advanced sorting techniques in Perl. Also, take a look at the Perl modules Sort::Maker (implements most of the methods described in the paper) and Sort::Key (probably the fastest).	[reply]