Commit e5c8995e by BellCodeEditor

auto save

parent adaf6f8a
Showing with 14 additions and 2 deletions
......@@ -6,4 +6,16 @@ for i in range(1, 101):
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
\ No newline at end of file
def binary_search(alist,num):
low = 0
high = len(num_list)
while low <=hight:
mid = (low+high)//2
b_num = num_list[mid]
if b_num = a_num:
return mid
elif b_num < a_num:
low = mid+1
else:
high = mid - 1
return None
\ 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