retagged by
424 views
0 votes
0 votes

retagged by

1 Answer

1 votes
1 votes

here we consider UNIFORM HASHING( as given) which states that the next item to be hashed has an equal probability of being placed into any of the slots independent of any other elements.

assuming that the hash values can be calculated in T(h(x)) =O(1) and the key value to be searched has an expected length of α.

than total time will be O(1+α).