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?

  1. A.

    O(1)

  2. B.

    O(n)

  3. C.

    O(n^2)

  4. D.

    O(log n)

Attempted by 713 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…