Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!usc!rutgers!gatech!uflorida!haven!adm!smoke!gwyn
From: gwyn@smoke.brl.mil (Doug Gwyn)
Newsgroups: comp.lang.c
Subject: Re: Hash??? Not quite clear on what this is...
Message-ID: <14563@smoke.brl.mil>
Date: 23 Nov 90 17:56:27 GMT
References: <17291@netcom.UUCP> <1990Nov22.235522.26487@ux1.cso.uiuc.edu>
Organization: U.S. Army Ballistic Research Laboratory, APG, MD.
Lines: 10

In article <1990Nov22.235522.26487@ux1.cso.uiuc.edu> gordon@osiris.cso.uiuc.edu (John Gordon) writes:
>So, if you are looking for the word "I", you would apply the hash function
>and come up with 1, and you would look in array element 1, and there it is!

Or, some other datum that hashes to the same bucket is there.  While
so-called "perfect hashing" doesn't have that problem, in practice
perfect hashing is rarely possible (normally only for language keywords
in a compiler); instead, support must be provided to resolve hash
collisions.  Simple-minded collision resolution schemes can perform
extremely poorly...