What is the worst-case time complexity of searching in a hash table using…
What is the worst-case time complexity of searching in a hash table using chaining?
- A.
O(1)
- B.
O(n)
- C.
O(n^2)
- D.
O(log n)
Attempted by 713 students.
Sign up free to check your answer
Sign up freeLoading lesson…

