save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+num_list = [1, 3, 5, 9, 11, 15, 17, 18, 20, 21]
 low = 0  #最低值
 low = 0  #最低值
 high = len(num_list)-1 #最高值
 high = len(num_list)-1 #最高值
 mid = (low + high)//2 #中间值
 mid = (low + high)//2 #中间值