Which of the following statements about binary search is NOT true?
1
Binary search has a time complexity of O(log n).
2
Binary search can be applied to any array, sorted or unsorted.
3
Binary search repeatedly divides the search interval in half.
4
Binary search requires the array to be sorted.