Commit 002aa505 by BellCodeEditor

save project

parent e7a7f140
Showing with 17 additions and 1 deletions
......@@ -3,11 +3,27 @@ num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
low = 0
high = len(num_list)-1
def binary_search(alist,num):
low = 0
high = len(alist)-1
while low <= high:
mid = (low + high)//2
guess = alist[mid]
if guess == num:
return mid
elif guess < num:
low = mid +1
eles:
high = mid - 1
return None
result = binary_search(alist,num)
print("老师给的数是:"num)
print("他在列表里索引是:"result)
while low <= high:
mid = (low+high)//2
guess_num = num_list[mid]
if guess_num == bingo_num:
print("找到了,他在列表里索引是:",mid)
print("找到了,他在列表里索引是",mid)
break
elif guess_num < bingo_num:
low = mi ld+1
......
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