Answer:
(B) will cut the portion of the array being searched in half each time the loop fails to locate the search value.
Explanation:
The binary search algorithm is a divide and conquer algorithm.It each divides the array in half when it is unsuccessful in finding the answer.It is more efficient than sequential search algorithm.The pre-requisite for binary search to implement is the array should be sorted either in increasing or decreasing order.You can code for array sorted in increasing and decreasing order.
