He's gonna need some optimisations, or War & peace:)He must be a quick reader then.
I timed the above program keeping 100 items which I think is reasonable. "AA" .. "ZZ" returns 676 items, thus that's about 575 possible loops that may use sort — which only actually happens if there's a new value in the current top 100. Eventually that should become quite rare. The program takes about 1/6th of a second on my system, a humble Pentium 500MHz. Doing the same for 1 million records will thus take about 6 minutes.
p.s. The loop without the sort takes 50ms. Thus, the sort takes about 2.4 times as long as the loop itself, or 70% of the total running time.
In reply to Re: Re: Re: Re: *Fastest* way to print a hash sorted by value
by bart
in thread *Fastest* way to print a hash sorted by value
by smellysocks
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |