Hashing question: Given alpha asking for the expected no of probes.
Consider the average time complexity in an unsuccessful search for open-addressing hashing with linear probing. If \( \alpha \) represents the load factor, which expression accurately represents the average time complexity?
- \( \frac{1}{1 + \alpha} \)
- \( \ln\left(\frac{1}{1 + \alpha}\right) \)
- \( 1 + \alpha \)
- \(1 + \frac{ \alpha}{2} \)
