save project

my_search.py

 import random
 
 alist = []
+def binary_search(bingonum,list_need):
+    high=len(list_need)-1
+    low=0
+    while high>=low:
+        mid=(high+low)//2
+        if list_need[mid]==bingonum:
+            return mid
+        elif list_need[mid]<bingonum:
+            low =mid+1
+        else:
+            high=mid-1
+    return None
 for i in range(1, 101):
     alist.append(i)
 num = random.choice(alist)
 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
-
-def binary_search(alist,num):
\ No newline at end of file
+print(binary_search(num,alist),num)