Commit f2797f4a by BellCodeEditor

auto save

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