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]
\ No newline at end of file
+
+wuke = 9
+low = 0
+high = len(num_list)-1
+while low <= high :
+    mid = (low+high) // 2
+    if num_list[mid] == wuke:
+        print("找到了")
+        exit()
+    elif num_list[mid] < wuke:
+        low = mid+1
+    else:
+        high = mid-1
+print("找不到")