Which of these statements is true?

A : Binary search still functions fine when the array it works on is unordered.

B : The best-case running times of unordered linear search, ordered linear search, and binary search are all different.

C : It probably takes less time to run an unordered search on an unsorted array than it does to mergesort it, then perform a binary search.

D : Binary search always needs to perform comparisons on at least half the data.