save project

binary_search.py

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