Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site watdaisy.UUCP
Path: utzoo!watmath!watdaisy!ndiamond
From: ndiamond@watdaisy.UUCP (Norman Diamond)
Newsgroups: net.lang,net.lang.pascal
Subject: Re: Hashing is not O(1), period.
Message-ID: <6948@watdaisy.UUCP>
Date: Mon, 11-Feb-85 14:49:44 EST
Article-I.D.: watdaisy.6948
Posted: Mon Feb 11 14:49:44 1985
Date-Received: Tue, 12-Feb-85 04:51:44 EST
References: <507@decwrl.UUCP>
Organization: U of Waterloo, Ontario
Lines: 16
Xref: watmath net.lang:1407 net.lang.pascal:233

Insertions in hash tables are not O(1) (period).

Insertions can be done in such a manner that searches and retrievals will
always be O(1).  Some of these insertions will be more expensive than
others.

Searches and retrievals in hash tables can be made O(1), period.
-- 

   Norman Diamond

UUCP:  {decvax|utzoo|ihnp4|allegra|clyde}!watmath!watdaisy!ndiamond
CSNET: ndiamond%watdaisy@waterloo.csnet
ARPA:  ndiamond%watdaisy%waterloo.csnet@csnet-relay.arpa

"Opinions are those of the keyboard, and do not reflect on me or higher-ups."