auto save

binary_search.py

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