Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site sdcc13.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!genrad!panda!talcott!harvard!seismo!hao!hplabs!sdcrdcf!sdcsvax!sdcc3!sdcc13!ee163acp
From: ee163acp@sdcc13.UUCP (DARIN JOHNSON)
Newsgroups: net.lang,net.lang.pascal
Subject: Re: Pointers and hashing
Message-ID: <143@sdcc13.UUCP>
Date: Fri, 1-Feb-85 03:32:28 EST
Article-I.D.: sdcc13.143
Posted: Fri Feb  1 03:32:28 1985
Date-Received: Mon, 4-Feb-85 04:57:00 EST
References: <400@decwrl.UUCP>
Organization: U.C. San Diego, Academic Computer Center
Lines: 11
Xref: watmath net.lang:1361 net.lang.pascal:221

> 
>     Hashing IS NOT an O(1) operation!
> 
>     Hashing is an O(N)/buckets operation, where many times you can use enough
> buckets to make it very fast.
> 
   True, but the beauty of the whole thing is that on the average, hash
   seems like O(1), and only rarely will you get a bad case.


   Darin Johnson @UCSD