Question

In simple uniform hashing what is the search complexity

Answer 1

o(1) is simple answer for u r question

Answer 2

The answer is O(1)

Explanation:

The SUHA "Simple Uniform Hashing Assumption" is an elementary assumption which aids the mathematical analysis of hash tables in computer science.

The assumption gives a hypothetical hashing function will uniformly distribute the element into the slot of the hash table. It takes possible two cases, one if the search is successful and the other when it is unsuccessful.

But in both cases, the complexity is O(1+alpha) where 1 is to compute the hash function and alpha is the load factor.