Which of the Following Statements About Binary Search of an Array

Which of the following statements about binary search of an array in ascending order is false?

A) The binary search algorithm is more efficient than linear search, but the linear search requires a sorted array.
B) The first iteration of this algorithm tests the middle element in the array. If this matches the search key, the algorithm ends.
C) If the search key is less than the middle element, it cannot match any element in the second half of the array so the algorithm continues with only the first half of the array (i.e., the first element up to, but not including, the middle element) .
D) If the search key is greater than the middle element, it cannot match any element in the first half of the array so the algorithm continues with only the second half of the array (i.e., the element after the middle element through the last element) .