Commit e823e811 by BellCodeEditor

save project

parent 14f2768d
Showing with 16 additions and 14 deletions
bingo_num = 7
num_list = [1,3,5,8,11,15,17,18,20,21]
low = 0
high = len(num_list)-1
while low <= high:
mid = (low + high) // 2
guess =num_list[mid]
if guess == bingo_num:
print("找到了,它的索引是:",mid)
break
elif guess < bingo_num:
low = mid + 1
else:
high = mid -1
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
low = 0
high = len(alist)-1
......@@ -29,5 +15,20 @@ def binary_search(alist,num):
high = mid - 1
return None
low = 0
high = len(num_list)-1
while low <= high:
mid = (low + high) // 2
guess =num_list[mid]
if guess == bingo_num:
print("找到了,它的索引是:",mid)
break
elif guess < bingo_num:
low = mid + 1
else:
high = mid - 1
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
result = binary_search(num_list,21)
print(result)
\ 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