查找算法之二分查找

def find(alist, item):

    find = False

    first = 0
    last = len(alist) - 1

    while first <= last:

        mid_index = (first + last) // 2
        if alist[mid_index] < item:
            first = mid_index + 1
        elif alist[mid_index] < item:
            last = mid_index - 1
        else:
            find = True
            break

    return find


alist = [1, 2, 3, 4, 5, 6]

print(find(alist, 5))