save project

binary_search.py

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