The binary search algorithm in the text makes recursive on subarrays of the array passed to the algorithm.The range passed to the search function is first to last.The search algorithm makes recursive calls on the left or right subarray that target will be in,if the target is present.What are the left and right ends of the left subarray?
A)first,mid - 1
B)first,mid + 1
C)mid - 1,left
D)mid + 1,left
E)left,mid

Question

Quizplus · Accepted Answer

In the binary search algorithm, if the middle element is greater than the search target, then we recursively search in the left subarray which ranges from first index to mid-1 index. Therefore, the left end of the left subarray is "first" and the right end of the left subarray is "mid-1". So, option A "first, mid-1" is the correct choice.

The Binary Search Algorithm in the Text Makes Recursive on Subarrays