>>One way to handle collisions is to look at your key and say, it's not
>>complicated enough.
>
> I'll just note here that trying to avoid
>collisions entirely is pointless. MINIMIZING collisions, however, is very
>helpful. Suggestions: create your table with a prime-number of available
>spaces, assuming an evenly-distributing hash algorithm. Never use integer
>values "as is" to become the key unless you have more spaces than
>possible values; otherwise they'll "clump" together, and you'll have more
>collisions than unique entries.


Bill:

I was explaining hashing as simple as I could. I didn't want to go into
sparce arrays and how to handle collisions too much, because it would
detract from me getting the basic idea of hashing across.

tedd

_______________________________________________________
http://sperling.com/