A method for Collision Resolution. Stores wherever an element is placed during collision for future retrieval defined by a probe.
Probes
Linear Probing
Quadratic Probing
Double Hashing
where is another Hash Function
Complexity
- Worst case insert time
A method for Collision Resolution. Stores wherever an element is placed during collision for future retrieval defined by a probe.
A[(h(k)+i)modm],i=0,1,2,…
A[(h(k)+i+c1i+c2i2)modm],i=0,1,2,…
A[(h(k)+i+h′(k))modm],i=0,1,2,… where h′(k) is another Hash Function