What is the average time complexity of operations (insert, delete, fetch) in a…
2024
What is the average time complexity of operations (insert, delete, fetch) in a well-constructed Hash Table?
Answer: A. O(1) — If the hash function is well defined and the hash table is not too heavily loaded, the average time complexity for each operation (insert, delete, fetch) is…
- A.
O(1)
- B.
O(log n)
- C.
O(n)
- D.
O(n^2)
Attempted by 484 students.
Show answer & explanation
Correct answer: A
If the hash function is well defined and the hash table is not too heavily loaded, the average time complexity for each operation (insert, delete, fetch) is O(1).
Loading lesson…