01 冒泡 和二分法

#冒泡
lst = [13,124,42543,3,6,3,63,637,5,747,758,58,231,23,414,53,64,6]
for a in range(len(lst)):
    i = 0
    while i < len(lst)-1:
        if lst[i] > lst[i + 1]:
            lst[i], lst[i+1] = lst[i+1], lst[i]
        i += 1
print(lst)
#二分法
n = 61
r = len(lst) -1
l = 0
count = 0
while l <= r:
    m = (l + r) // 2
    if n > lst[m]:
        l = m + 1
    elif n < lst[m]:
        r = m - 1
    else:
        print(count)
        print("找到了")
        print(m)
        break
    count += 1
else:
    print("不存在")