What is the time complexity of searching, deleting and inserting into direct addressing in hashing? A. O(1),

Question:

What is the time complexity of searching, deleting and inserting into direct addressing in hashing?

A. O(1), O(n), O(1)
B. O(n), O(n), O(1)
C. O(1), O(1), O(1)
D. O(1), O(n), O(n2)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: