in reply to Re3: Hash key counting (2=>1)
in thread Hash key counting

My array would get so big, but is sparsely populated
How is that an argument in this case? He's adding sequentially numbered keys, so the population is as dense as at all possible.

Makeshifts last the longest.