The binary search algorithm in the text makes recursive calls 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 right subarray?
A)Last ,mid - 1
B)last ,mid + 1
C)mid - 1,last
D)mid + 1,last
E)last,mid

Question

Quizplus · Accepted Answer

The right subarray, when dividing an array for a binary search, starts just after the midpoint to exclude the already checked middle element. Therefore, the correct range for the right subarray is from mid + 1 to last, making D) mid + 1, last the correct choice.

The Binary Search Algorithm in the Text Makes Recursive Calls