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

Did you try it?
I thought that too but testing samtregar and kyles versions took the same time. Ikegamis version is about 6% slower.
  • Comment on Re^3: Sorting keys of hash table by values

Replies are listed 'Best First'.
Re^4: Sorting keys of hash table by values
by rjray (Chaplain) on Jan 31, 2008 at 23:12 UTC

    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

[reply]
      2000 and 5000 keys, 1000 and 3000 iterations.

      Code:

      Read more... (940 Bytes)
[reply]
[d/l]

In Section Seekers of Perl Wisdom