Commit 06323c7b by BellCodeEditor

auto save

parent 604d2fe6
Showing with 7 additions and 12 deletions
......@@ -6,22 +6,18 @@ for i in range(1, 101):
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(,num): # 使用二分查找法,找出9和20在列表里面的索引
low=0
high=len(alist)-1
for i in range(2):
def binary_search(alist,num): # 使用二分查找法,找出9和20在列表里面的索引
low=0
high=len(alist)-1
while True:
mid=(high+low)//2
guess=num_list[mid]
guess=alist[mid]
if guess==num:
print('找到了'+'num')
break
elif guess<num:
low=mid+1
elif guess>num:
high=mid-1
elif num_list[high]<num_list[low]:
print('木有')
break
print(mid)
num=20
\ No newline at end of file
return num
binary_search(alist,num)
print(num)
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