Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^4: Sorting keys of hash table by values

by rjray (Chaplain)
on Jan 31, 2008 at 23:12 UTC ( [id://665482] : note . print w/replies, xml ) Need Help??


in reply to Re^3: Sorting keys of hash table by values
in thread Sorting keys of hash table by values

How did you test it? What size(s) of hash tables? How many iterations? Particularly if the hash table is small, the differences could be swallowed up by variations in the O/S CPU scheduling and other tasks running at the same time.

--rjray

  • Comment on Re^4: Sorting keys of hash table by values

Replies are listed 'Best First'.
Re^5: Sorting keys of hash table by values
by lidden (Curate) on Jan 31, 2008 at 23:30 UTC
    2000 and 5000 keys, 1000 and 3000 iterations.

    Code: