二分法搜索

二分法优化查找的范围，不用遍历，效率高，O(logn)
递归版本 

#-*- coding:utf-8 -*-

def binary_serch(lis, item):
    n=len(lis)
    mid=n//2  #中间搜索点
    print("mid:", mid)
    if n >= 1:
        if lis[mid] == item:
            return True

        elif lis[mid] > item:
            #这里传入一个新的列表,
            return binary_serch(lis[:mid], item)
        elif lis[mid] < item:
            return binary_serch(lis[mid+1:], item)

        #没找到数据:
        else:
            return False

if __name__ == "__main__":
    lis=[0,1,2,3,4,5,6]
    result=binary_serch(lis, 1)
    print(result)

非递归版本：

def binary_search_2(alist, item):
    start = 0
    end = len(alist) - 1
 
    while start <= end:
        mid = (start + end) // 2
        if alist[mid] == item:
            return True
        elif item < alist[mid]:
            end = mid - 1
        else:
            start = mid + 1
    return False
 
if __name__ == '__main__':
    testlist = [0, 3, 4, 8, 15, 30, 39, 50, 66, 86, 95]
    print(binary_search_2(testlist, 15))
    print(binary_search_2(testlist, 52))