save project

binary_search.py

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