少儿编程之查找算法，顺序查找与二分查找

1、顺序查找

ls = [3, 1, 2, 22, 5, 10, 8, 30]
x = 8	# 待查找的元素
b = -1	# 标记是否找到元素
i = 0
for i in range(len(ls)):
    if x == ls[i]:
        b = 1
        break

if b == 1:
    print("找到该元素了，索引值为", i)
else:
    print("该元素不在列表中")

输出结果：

2、二分查找

ls = [1, 2, 3, 5, 8, 10, 22, 30]

left = 0
right = len(ls) - 1
x = 8	# 待查找的元素
b = -1	# 标记是否找到元素
mid = 0
while left <= right:
    mid = left + (right - left) // 2
    if ls[mid] == x:
        b = 1
        break
    elif ls[mid] > x:
        right = mid - 1
    else:
        left = mid + 1

if b == 1:
    print("找到元素了，索引值为", mid)
else:
    print("该元素不在列表中")

输出结果：