The divide-and-conquer method is used in binary search. It operates on a sorted array, by continually halving the search interval.
Sort: