Which of the following is not true of binary search?

A : Doubling the size of the input only increases the number of steps required by 1.

B : Each iteration of binary search rules out roughly half the array.

C : It is possible for binary search to terminate after the first comparison.

D : Binary search works equally well on sorted and unsorted arrays.

E : The worst case performance of binary search is logarithmic in the size of the input.

F: If the input array is large enough, binary search will be faster than linear search even if every operation in the linear search runs 100 times as fast as every operation in the binary search.