Algorithms in Java

The search algorithms that we have been considering are based on an abstract comparison operation. A significant exception to this assertion is the key-indexed search...

The first problem that we must address is the computation of the hash function, which transforms keys into table addresses. This arithmetic computation is normally...

The hash methods discussed in Section convert keys into table addresses; the second component of a hashing algorithm is to decide how to handle the...

If we can estimate in advance the number of elements to be put into the hash table and have enough contiguous memory available to hold...

The operative principle of linear probing (and indeed of any hashing method) is a guarantee that, when we are searching for a particular key, we...

As the number of keys in a hash table increases, search performance degrades. With separate chaining, the search time increases gradually—when the number of keys...

The choice of the hashing method that is best suited for a particular application depends on many different factors, as we have discussed when examining...