Double hashing is a technique used in open addressing for resolving collisions in hash tables. When two keys hash to the same index, double hashing provides a way to find an alternative or "probe" location in the hash table based on a secondary hash function. This reduces clustering and improves the distribution of entries in the hash table. In double hashing, when a collision occurs, a secondary hash function is applied to generate a step size for probing.
New to topics? Read the docs here!