Commit 796ce352 by BellCodeEditor

auto save

parent adaf6f8a
Showing with 15 additions and 9 deletions
import random
a=[1,3,5,8,11,15,17,18,20,21]
low=0
h=len(a)-1
shu=1 #找的数
alist = []
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
while low<=h:
mid = (low+h)//2
g=a[mid]
if g==shu:
print("找到了",mid)
break
elif g <shu:
low = mid+1
elif g>shu:
h = mid-1
\ No newline at end of file
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