python 二分法查找

# 二分法
def binarySearch(x):
    arr = [1, 2, 3, 5, 6, 7, 8, 9, 123, 567, 2345, 23456]
    l = len(arr)
    i = -1
    start = 0
    end = l -1
    while end > start:
        half = (start + end) // 2
        if arr[half] > x :
            end = half
        elif arr[half]  
输出：
 
4