On Mon, Mar 02, 2009 at 08:22:24PM +0000, Nicholas Clark wrote:
> Hash lookup should be O(1), independent of number of keys. Of course, a hash
> with more keys uses more memory, but so does an array with more elements.
But that's a bigger value of 1 from that required for an array lookup.
--
David Cantrell | Enforcer, South London Linguistic Massive
When one has bathed in Christ there is no need to bathe a second time
-- St. Jerome, on why washing is a vile pagan practice
in a letter to Heliodorus, 373 or 374 AD
