save project

binary_search.py

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