Question: What is the time complexity of searching for an element in a hash table in the average case?

Options:

1. O(n)
2. O(log n)
3. O(1)
4. O(n log n)

Correct Answer: O(1)

Solution:

In the average case, searching for an element in a hash table has a time complexity of O(1) due to direct indexing.