Worst-Case Comparisons in Binary Search - iragecapital OA Question | OAHelper
Company: iragecapital
Difficulty: easy
Problem Statement
Worst-Case Comparisons in Binary Search The maximum number of comparisons binary search performs on a sorted array of 1000 elements is: A. 9 B. 10 C. 11 D. 1000