Question

A sorted array contains 1000 elements. Using Binary Search, what is the maximum number of comparisons needed, in the worst case, to determine whether a target value is present in the array?

Q: Answer-A sorted array contains 1000 elements. Using Binary Search, what is the maximum number of comparison...

Binary searchs worst-case number of comparisons is given by logn 1 for an array of n elements. For n 1000 log1000 9.9658, and taking the floor gives 9. Adding 1 gives a maximum of 10 comparisons. This makes intuitive sense too each comparison can at best halve the remaining search space, and 210 1024 is the smallest power of 2 that is 1000 elements while 29 512 is not enough, confirming that 10 comparisons suffice and may be needed to narrow down to a single element.