Binary Search

def binary_search( seq, n):
    low, high= 0, len(seq)-1
    while low <= high:
        mid= (low + high)/2;
        if n == seq[mid]:
            return True
        elif n < seq[mid]:
            high= mid -1
        elif n > seq[mid]:
            low= mid +1
    return False


if __name__ == "__main__":
    seq= [1,5,9,12,18,35]
    print binary_search( seq, 15)