Contents    Page-10    Prev    Next    Page+10    Index   


If a fixed-size hash table is used with some secondary hash function to deal with collisions, the number of comparisons will become larger as λ increases, with a knee around λ = 0.7 .

When this happens, it will be necessary to expand the array by:

The rehashing process is O(n), but only has to be done once every n times, so its amortized cost is O(1).