If we compare hash table performance with binary search of a sorted array, the number of comparisons required by binary search is ____. A) O(1) B) O(n) C) O(log₂n) D) O(log n)

Name: If we compare hash table performance with binary search of a sorted array, the number of comparisons required by binary search is ____. A) O(1) B) O(n) C) O(log 2 n) D) O(log n)
Brand: Quizplus
Rating: 4.8 (31 reviews)

Question

Quizplus · Accepted Answer

Binary search on a sorted array has a time complexity of O(log n) because it divides the search interval in half with each step.

If We Compare Hash Table Performance with Binary Search of a Sorted