A divide and conquer method

Binary Search is defined as a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O (log N). The data structure must be sorted to implement the algorithm, and access to any data structure element should take a constant time.