Next: 3.6.3 Result 3: Successful Search
Up: 3.6 Analysis of Closed Hashing
Previous: 3.6.1 Result 1: Unsuccessful Search
- Insertion of an element requires at
probes on average.
- Proof is obvious because inserting a key requires an unsuccessful search
followed by a placement of the key in the first empty slot found.