Commit adaaba9e by BellCodeEditor

save project

parent b250abfe
Showing with 34 additions and 0 deletions
import random
alist = []
for i in range(1,101):
alist.append(i)
num = random.choice(alist)
def binary_scarch(alist,num):
low = 0
hight = len(alist)-1
while low <= hight:
mid = (low + hight) // 2
guess = alist[mid]
if guess == num:
return mid
elif guess < num:
low = mid + 1
elif guess > num:
hight = mid -1
\ No newline at end of file
# 使用二分查找法,找出9和20在列表里面的索引
num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
num = 9
low = 0
hight = 9
while True:
mid = (low+hight) // 2
guess = num_list[mid]
if guess == num:
print("找到了")
break
elif guess < num:
low = mid + 1
else:
high = mid - 1
\ 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