auto save

binary_search.py

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