Commit f2252082 by BellCodeEditor

auto save

parent 3ac5a80d
Showing with 12 additions and 0 deletions
......@@ -7,3 +7,15 @@ num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
while d>x:
z=(d+x)//2
guess=num_list[z]
if num>guess:
x=z+1
elif num<guess:
d=z-1
elif num==guess:
print('找到了')
break
else:
print('找不到')
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