Which of the Following Statements Is False

Which of the following statements is false?

A) The xe "efficiency of:linear search"linear search algorithm runs in O(n) time.
B) The worst case in the linear search algorithm is that every element must be checked to determine whether the search item exists in the array. If the size of the array is doubled, the number of comparisons that the algorithm must perform is quadrupled.
C) Linear search can provide outstanding performance if the element matching the search key happens to be at or near the front of the array.
D) Linear search is easy to program, but it can be slow compared to other search algorithms. If a program needs to perform many searches on large arrays, it's better to implement a more efficient algorithm, such as the binary search.