二分查找递归版本python实现

def binary_search(arr,item):
    n = len(arr)
    mid = n//2

    if n>0:
        if arr[mid] == item:
            return True
        elif arr[mid] > item:
            return binary_search(arr[:mid],item)
        else:
            return binary_search(arr[mid+1:],item)
    return False

if  __name__ == '__main__':
    li = [1,12,3,5,2,5,1,56,1,5,12,5,12,4]
    print(binary_search(li,1))
    print(binary_search(li,88899))