Binary Search program in Python
In a sorted array, binary search is a searching technique that divides the search interval in half periodically. The goal behind binary search is to use the fact that the array is sorted to reduce the time complexity to O(log n).