Home › MCQs › CSS Computer Science › Question #1130
Back to Questions
CSS Computer Science QUESTION #1130
Question 1
What is the time complexity of searching for an element in a hash table?
  • O(1)✔️
  • O(n)
  • O(nlogn)
  • None of these
Correct Answer Explanation
In an ideal scenario (with a good hash function and minimal collisions), the average time complexity for searching in a hash table is constant time, O(1).