Explanation

On average, searching in a well-implemented hash table has a time complexity of O(1) (constant time) due to direct indexing using the hash function.

In the worst-case scenario, if many elements hash to the same index (collisions), the time complexity can degrade to O(n) (linear time).