Vidyalelo
Data Structure · Q95

Hashing

Programming · Data Structure · question 95

Q95

What is the worst case search time of a hashing using separate chaining algorithm?

A.
O(N log N)
B.
O(N)
Answer
C.
O(N2)
D.
O(N3)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board