Which of the following statements is true of the worst-case performance of unordered linear search, ordered linear search, and binary search on large arrays?

A : The worst case for all three of these algorithms is the same.

B : Unordered linear search is the worst, ordered linear search is the next best, and binary search is the best.

C : The worst-case behaviors of unordered linear search and ordered linear search are identical, but binary search has better worst-case performance than either of them.

D : The worst-case performance of unordered search depends on the exact order of the array - it could be either the best of the three or the worst.