Question

Suppose an array A contains
n=1000 elements. The number
of comparisons required (in
worst case) to search an
element (say x) using binary
search algorithm:​

Answer 1

Answer:

Binary search starts in the middle so if it is found the search is over 4. What is the maximum number of comparisons that a binary search function will make when searching for a value in a 1,000-element array? With a 1,000 element this takes no more than 10 comparisons 5.

Explanation:

Answer 2

it is your answer I hope it will help you please mark as brainliest thanks and follow me guys