算法: 二分查找 冒泡 插入 选择排序

li = [1, 3, 5, 7, 9, 11, 15, 18, 20]

def linear_serach(li, value):
    for i in range(len(li)):
        if li[i] == value:
            return i
    return
print(linear_serach(li,3))

li = [1, 3, 5, 7, 9, 11, 15, 18, 20]
def bin_serach(li, value):
    low = 0
    high = len(li) - 1
    while low < high:
        mid = (low + high) // 2
        if li[mid] > value:
            high = mid - 1
        elif li[mid] < value:
            low = mid + 1
        else:
            return mid
print(bin_serach(li, 3))
# 时间复杂度: 0(logn)