Commit d6b2c808 by BellCodeEditor

save project

parent adaf6f8a
Showing with 29 additions and 2 deletions
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
bingo_num=20
low=0
high=len(num_list)-1
while low<=high:
guess_num=(low+high)//2
if guess_num==bingo_num:
print("找到了")
break
elif guess_num<bingo_num:
low=mid+1
else:
guess_num<bingo_num
high=mid-1
\ No newline at end of file
...@@ -6,4 +6,17 @@ for i in range(1, 101): ...@@ -6,4 +6,17 @@ for i in range(1, 101):
num = random.choice(alist) num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num): def binary_search(alist,num):
\ No newline at end of file high=len(num_list)-1
low=0
guess=(alistr+num)//2
if num==guess:
return None
elif guess<num:
low=mid+1
elif guess<num:
high=mid-1
print()
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