【算法】二分查找

# 二分查找
# @Time: 2018/6/21
# @Author: xfLi

def half_search(search_list, key):
    left = 0
    right = len(search_list)
    while left <= right:
        mid = int((left + right) / 2)
        if search_list[mid] == key: return mid
        elif search_list[mid] < key: left = mid + 1
        else: right = mid - 1
    return -1

if __name__ == '__main__':
    s_list = [1, 3, 7, 9, 11, 23, 45, 67, 78, 89]
    key = 3
    idx = half_search(s_list, key)
    print(idx)