二分的循环条件

def bisearch(nums):
    low = 0
    high = len(nums,target)
    while low <= high:
        mid = (low + high) / 2
        if target == nums[mid]:
            return mid
        elif target > nums[mid]:
            low = mid + 1
        else:
            high = mid - 1