Author: Stan Eisenstat
Subject: Re: [Cs323] None
Date: Saturday, 31 Oct 2020, 18:08:00

    > Message Posted By: Unknown
    >
    > Can the search time for decode be the same as encode, or must it be O(1)

The number of chains must grow as the size of the hash
table grows so that the load average L remains small.
Thus under the usual assumption that the length of a
chain never grows much larger than L, the search times
for both encode and decode should be O(1).

--Stan-