engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Searching, Sorting and Hashing Searching
Consider an open-address hash table with uniform hashing. What is the time complexity for successful search with n elements?
1
\(O(n^2)\)
2
\(O(n)\)
3
\(O(logn)\)
4
\(O(1)\)