python实现简单二分法

k = 7
array = [1,2,3,4,5,6,7]
mid = len(array) // 2
count = 0
def searchValue(left, right):
    global mid
    global count
    global k
    count = count + 1
    mid = (left + right) // 2
    print('第%d次查找,left=%d,right=%d,mid=%d' % (count, left, right, mid))
    if left < 0:
        return
    if right > 6:
        return
    if array[mid] == k:
        print('success')
    elif array[mid] > k:
        searchValue(left, mid - 1)
    elif array[mid] < k:
        searchValue(mid + 1, right)

searchValue(0, 6)

第1次查找,left=0,right=6,mid=3
第2次查找,left=4,right=6,mid=5
第3次查找,left=6,right=6,mid=6
success