Commit 768f2652 by BellCodeEditor

save project

parent adaf6f8a
Showing with 16 additions and 0 deletions
......@@ -4,6 +4,22 @@ alist = []
for i in range(1, 101):
alist.append(i)
num = random.choice(alist)
print(num)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
low = 0
high = len(alist) - 1
while low <= high:
mid = (low + high) //2
if alist[mid] == num:
return mid
elif num > alist[mid]:
low = mid + 1
else:
high = mid - 1
out = binary_search(alist,num)
print(out)
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