Commit 0d1cf26e by BellCodeEditor

save project

parent adaf6f8a
Showing with 19 additions and 2 deletions
...@@ -6,4 +6,22 @@ for i in range(1, 101): ...@@ -6,4 +6,22 @@ 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 #num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
low = 0
high = len(alist)-1
while low <= high:
mid = (low+high) // 2
guess_num = alist[mid]
if guess_num == num:
return mid
elif guess_num < num:
low = mid+1
elif guess_num > num:
high = mid-1
return None
a = binary_search(alist,num)
print("数字",num)
print("索引",a)
print("索引对应的值",alist[a])
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