+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity of search function in a hash table using a doubly linked list?

(a) O(1)

(b) O(n)

(c) O(log n)

(d) O(n log n)

This interesting question is from Hash Tables in section Hash Tables of Data Structures & Algorithms I

I have been asked this question in examination.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (a) O(1)

To explain: Time complexity of search function in a hash table is O(1). Condition is that the number of collisions should be low.

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

...