+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the time complexity to insert an element into the direct address table?

(a) O(n)

(b) O(logn)

(c) O(nlogn)

(d) O(1)

This is a very interesting question from Direct Addressing Tables in chapter Hash Tables of Data Structures & Algorithms I

This question was posed to me in examination.

1 Answer

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

The best I can explain: As every key has a unique array position, it takes constant time to insert an element.

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

...