python 二分法查找 非递归

def binary_1(arr,t):
    if len(arr)==0:
        return
    height = len(arr)-1
    low = 0
    while low <= height:
        mid = (height+low) / 2
        if arr[mid]>t:
            height = mid-1
        elif arr[mid]<t:
            low=mid+1
        else:
            return mid
    return -1