auto save

binary_search.py

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