Commit 0ceeddf0 by BellCodeEditor

save project

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