Load Factor in Double Hashing
For any ? < 1, double hashing will find an empty slot (given appropriate table size and hash2)
Search cost appears to approach optimal (random hash):
- successful search:
-
-
- unsuccessful search:
-
No primary clustering and no secondary clustering
One extra hash calculation