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

Category: QuestionsWhat is the worst case search time of a hashing using separate chaining algorithm?
Editor">Editor Staff asked 4 weeks ago

What is the worst case search time of a hashing using separate chaining algorithm?
 
(a) O(N log N)
 
(b) O(N)
 
(c) O(N^2)
 
(d) O(N^3)
 
The above asked question is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I
 
I got this question in unit test.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right answer is (b) O(N)
 
For explanation: The worst case search time of separate chaining algorithm using linked lists is mathematically found to be O(N).