The divide-and-conquer method is used in binary search. It operates on a sorted array, by continually halving the search interval. But for unsorted elements, we have to sort the array first using any sorting algorithm and then have to apply binary search.
2 Comments
Sort: