binary_search.py

def search(list, n):
    l = 0
    u = len(list) - 1

    while 1 <= u:
        mid = (l + u) // 2

        if list[mid] == n:
            return True
        else:
            if list[mid] < n:
                l = mid + 1
            else:
                u = mid - 1
    return False


list = [1, 3, 4, 7, 8, 9, 10, 45, 50, 90, 100, 150, 600, 1000]
n = 90

if search(list, n):
    print("Found")
else:
    print("Not Found")