Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Benchmarking hash sort vs. walk (Was: Re: Re: Returning the lowest key in a hash (or highest))by larryl (Monk) |
on Mar 26, 2001 at 01:03 UTC ( [id://67059]=note: print w/replies, xml ) | Need Help?? |
Here's a benchmark I tried that compares sorting to hash-walking for hashes of various sizes, and the results confirm Dominus's expectations. The hash entries are generated using rand(65000) and both subs are given the same hash to work with. (I think the comparison is pretty fair, let me know if you have ideas for either of the subs!) The code:
The results: Size sort walk 10 8329.50/s 5289.68/s (sort wins!) 100 1020.53/s 727.29/s (sort wins!) 1000 94.68/s 80.14/s (sort wins!) 10000 7.15/s 7.31/s (almost a wash...) 100000 0.52/s 0.73/s (walking wins!)
In Section
Seekers of Perl Wisdom
|
|