save project

binary_search.py

-# 使用二分查找法，找出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]
+midlow,hight, = (len(num_list)-1)// 2 , 0 , len(num_list)-1,17
\ No newline at end of file
+def binary_sear(num_list,num):
+    low , hight = 0 , len(num_list)-1
+while low <= hight:
+    mid = (low + hight)//2
+    if num == num_list[mid] :
+        print("找到了，索引值",mid)
+        break
+    if num_list[mid] < num:
+        low = mid + 1
+    else:
+        hight = mid - 1
+ans = random.chois(num_list)
+print(ans)
+binary_sear(num_list,ans)