二分查找

# _*_coding:utf-8_*_
# create by TynMh 2019-05-26 22:38


def binary_search(li, val):
    left = 0
    right = len(li) - 1
    while left <= right:   # 候选区有值
        mid = (left + right) // 2
        if li[mid] == val:
            return mid
        elif li[mid] > val:   # 待查找的值在mid左侧
            right = mid - 1
        else:  # li[mid] < val  待查找的值在mid右侧
            left = mid + 1
    else:
        return None


binary_search(list(range(10000)), 1000)