Beginner
Data Structures & Algorithms
Q20 / 100
What is the average-case time complexity of searching in a hash table?
Correct! Well done.
Incorrect.
The correct answer is D) O(1)
D
Correct Answer
O(1)
Explanation
With a good hash function and low load factor, the average case for search, insert, and delete in a hash table is O(1). Collisions can degrade this to O(n).
Progress
20/100