【数据结构】【排序与查找】顺序查找，二分查找

def sequentialSearch(alist, item):
    """无序表查找
    """
    pos = 0
    found = False
    while pos < len(alist) and not found:
        if alist[pos] == item:
            found = True
        else:
            pos = pos + 1
    
    return found

testlist = [1,2,32,6,17,19,42,13,0]
print(sequentialSearch(testlist, 3))
print(sequentialSearch(testlist, 13))

def orderedSequentialSearch(alist, item):
    """有序表查找
    """
    pos = 0
    found = False
    stop = False
    while pos < len(alist) and not found and not stop:
        if alist[pos] == item:
            found = True
        else:
            if alist[pos] > item:
                stop = True  # 提前退出
            else:
                pos = pos + 1
    
    return found

testlist = [0,1,2,8,13,17,19,42]
print(orderedSequentialSearch(testlist, 3))
print(orderedSequentialSearch(testlist, 13))

def binarySearch(alist, item):
    first = 0
    last = len(alist)-1
    found = False
    while first <= last and not found:
        midpoint = (first + last) // 2
        if alist[midpoint] == item:  # 中间项对比
            found = True
        else:  # 缩小对比范围
            if item < alist[midpoint]:
                last = midpoint-1
            else:
                first = midpoint+1
    return found

testlist = [0,1,2,8,13,17,19,42]
print(binarySearch(testlist, 3))
print(binarySearch(testlist, 13))

def binarySearch(alist, item):
    if len(alist) == 0:
        return False  # 结束条件
    else:
        midpoint = (first + last) // 2
        if alist[midpoint] == item:  
            return True
        else: # 缩小规模
            if item < alist[midpoint]:
                return binarySearch(alist[:midpoint], item)  # 调用自身
            else:
                return binarySearch([midpoint:], item)

testlist = [0,1,2,8,13,17,19,42]
print(binarySearch(testlist, 3))
print(binarySearch(testlist, 13))