Question

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.

Answer 1

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.