Commit d0753ebd by BellCodeEditor

auto save

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