What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) .
there are two derivations given one leads to 1/(1-α) and the other leads to 1/2(1+1/(1-α)^2)
plz explain the distinction ?