Commit c51a4be8 by BellCodeEditor

auto save

parent adaf6f8a
Showing with 19 additions and 3 deletions
...@@ -3,7 +3,23 @@ import random ...@@ -3,7 +3,23 @@ import random
alist = [] alist = []
for i in range(1, 101): for i in range(1, 101):
alist.append(i) alist.append(i)
num = random.choice(alist) hidenum = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num): def binary_search(alist,hidenum):
\ No newline at end of file low = 0
higt = len(alist) - 1
while low <= higt:
mid = (low+higt) // 2 #mid = 5
gusse = alist[mid] #guess=11
if gusse == hidenum:
return mid
elif gusse < hidenum:
low = mid+1
elif gusse > hidenum:
higt = mid-1
return None
ok = binary_search(alist,hidenum)
print('老师给的数为,',hidenum)
print('索引为,',ok)
\ 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