auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+import random
+for i in range(1,101):
+    num_list.append(i)
 low=0
 high=len(num_list)-1
 num=20
 while low>hige:
-mid = (low+high) // 2
+    mid = (low+high) // 2
         if mid == num:
             print("找到了")
         elif mid < num:
             low = mid+1
         else:
             high = mid-1
-print(mid)
\ No newline at end of file
+    print(mid)
\ No newline at end of file