save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 low=0
-high=len(num_list-1)
-mid=(low+high)//2
-guess=num_list[mid]
+high=len(num_list)-1
 while True:
+    mid=(low+high)//2
+    guess=num_list[mid]
     if guess==17:
         print("找到了！")
         break