検索：Pythonは二分法を実装します

#二分法查找

def binaSearch(li,tv):
    li.sort()
    print(li)
    left=0
    right =len(li)-1
    while left<= right:
        mid = (left+right) // 2
        if li[mid] == tv:
            return mid
        elif li[mid] > tv:
            right = mid -1
        else:
            left = mid + 1
    else:
        return -1

li = [534,54,2,5,732,8,77,4]
print(binaSearch(li,5))