The binary search algorithm in the text makes recursive on subarrays of the array passed to the algorithm.The index values of the array the algorithm searches run from first to last.The subarrays are dermined using the mid-point.How is the mid point calculate?
A)mid = (first - last)/2;
B)mid = (first + last)/2;
C)mid = (first + last)%2;
D)mid = (first - last)%2;

Question

Quizplus · Accepted Answer

The mid point is calculated as the sum of the first and last index of the subarray, divided by 2. This gives an integer value which is the index of the middle element in the subarray. So, the correct formula is mid = (first + last)/2.

The Binary Search Algorithm in the Text Makes Recursive on Subarrays