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

(a) O(n)

(b) O(logn)

(c) O(nlogn)

(d) O(1)

Question is taken from Direct Addressing Tables in chapter Hash Tables of Data Structures & Algorithms I

I have been asked this question during an internship interview.

1 Answer

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

The explanation is: As every key has a unique array position, it takes constant time to delete an element, although the deleted position must be specified by nil.

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

...