+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...