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:
C Explanation Hashing functio...View the full answer
Answered By
Susan Juma
I'm available and reachable 24/7. I have high experience in helping students with their assignments, proposals, and dissertations. Most importantly, I'm a professional accountant and I can handle all kinds of accounting and finance problems.
15+ Reviews
45+ Question Solved
Related Book For 
Data Structures Using C A Practical Approach For Beginners
ISBN: 9781000470741
1st Edition
Authors: Amol M Jagtap, Ajit S Mali
Question Posted:
