二分查找

def binary_search(arry,target):
    min=0
    max=len(arry)-1
    while min<=max:
        mid=int((min+max)/2)
        if target==arry[mid]:
            return mid
        elif target<arry[mid]:
            max=mid-1
        else:
            min=mid+1
    return None