Commit fdffdec5 by BellCodeEditor

auto save

parent adaf6f8a
Showing with 15 additions and 3 deletions
......@@ -3,7 +3,20 @@ import random
alist = []
for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
num =
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file
def binary_search(alist,num_list):
low=0
high=len(alist)-1
num=
while low<high:
mid=(low+high)//2
gues=alist[mid]
print(num,"的索引是",mid)
break
elif guess<num:
low=mid+1
else:
high=mid-1
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