in reply to Reaped: Re: Performance of hash and array inserts
in thread Performance of hash and array inserts

> Because hash algorithms purposely try to distribute values widely, they are naturally more susceptible to this influence.

Nonsense-Mike again ...

When hashes grow they allocate in doubling steps, they don't waste much space in the internal lookup table, which is just an array anyway

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery

  • Comment on Re^2: Performance of hash and array inserts

In Section Meditations