template.py

def binary_search(array):
    def condition(value):
        pass
    # could be [0, n], [1, n] etc. Depends on problem
    left, right = min(search_space), max(search_space) 
    while left < right:
        mid = left + (right - left) // 2
        if condition(mid):
            right = mid
        else:
            left = mid + 1
    return left