Quadratic probing is a collision resolution technique used in open addressing hash tables. Open addressing is a method of handling collisions when two keys hash to the same index in the hash table. In quadratic probing, the algorithm attempts to find the next available position in the hash table by using a quadratic function of the number of probes. ### How Quadratic Probing Works: 1. **Hash Function**: When inserting a key into the hash table, a hash function computes an initial index.
New to topics? Read the docs here!