save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+from random import choice
+shu=0
+num_list = []
+while shu<=100:
+    num_list.append(shu)
+    shu+=1
+print(num_list)
 
-low=0
-high=len(num_list)-1
-while True:
-    mid=(low+high)//2
-    guess=num_list[mid]
-    if guess==20:
-        print('找到了'+str(mid))
-        exit()
-    elif guess<20:
-        low=mid+1
-    else:
-        high=mid-1
+def efcz(list,num):
+    low=0
+    high=len(list)-1
+    while low<=high:
+        mid=(low+high)//2
+        guess=num_list[mid]
+        if guess==num:
+            return num
+        elif guess<num:
+            low=mid+1
+        else:
+            high=mid-1
 
-low2=0
-high2=len(num_list)-1
-while True:
-    zjs=(low2+high2)//2
-    caice=num_list[zjs]
-    if caice==9:
-        print('找到了')
-        exit()
-    elif caice<9:
-        low2=zjs+1
-    else:
-        high2=zjs-1
\ No newline at end of file
+daan=choice(num_list)
+a=efcz(num_list,daan)
+print(a)
\ No newline at end of file