Re^2: What is the most memory efficient way to (sort) and print a hash?

Many thanks choroba. That prints the hash with no further memory usage which helps a lot. If you, or others, can suggest a better way to get sorted output then that would be a bonus.

Comment on Re^2: What is the most memory efficient way to (sort) and print a hash?

Replies are listed 'Best First'.
Re^3: What is the most memory efficient way to (sort) and print a hash? by AnomalousMonk (Archbishop) on May 29, 2014 at 17:51 UTC
That prints the hash ... a ... way to get sorted output ... would be a bonus. So, what happens if you then actually (system) sort the output per choroba's original suggestion?	[reply]
Re^3: What is the most memory efficient way to (sort) and print a hash? by runrig (Abbot) on May 29, 2014 at 18:25 UTC
Define 'better' in relation to the suggested answer. There are trade-offs whether you use this solution or another, e.g., using a database as suggested elsewhere in this thread.	[reply]
Re^3: What is the most memory efficient way to (sort) and print a hash? by no_slogan (Deacon) on May 29, 2014 at 18:14 UTC
File::Sort rather than `system "sort"`?	[reply]