Commit 402216ae by BellCodeEditor

save project

parent b7661c5e
Showing with 12 additions and 0 deletions
......@@ -6,4 +6,16 @@ for i in range(1, 101):
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
high=len(alist)-1
low= 0
def binary_search(alist,num):
while low<=high:
mid=(high+low)//2
guess_num=int(alist[mid])
if guess_num==num:
return mid
elif guess_num < num:
low=mid+1
elif guess_num > num:
high=mid-1
none
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment