Double Hashing is a strategy for #202112131222 that use two hash function instead of one to search an empty cell in the 202112122035.
Details
- 202112122038 is usually \(F(i) = i \cdot \text{hash}_2(X)\)
Analysis
- The best second Hash Function is \(R - (X \mod R)\)
- Number of probes is almost equals to other collision resolution strategy
Attention
- The second Hash Function should never evaluate to 0
- Ensure that all cells in the Table can be probed