Commit 2e011654 by BellCodeEditor

auto save

parent adaf6f8a
Showing with 19 additions and 2 deletions
......@@ -6,4 +6,21 @@ 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):
ok = num
low = 0
high = len(alist)-1
while low < high:
mid =( low + high ) // 2
guess = alist[ mid ]
if guess == ok:
print("猜对了,索引位置是",mid)
return
break
elif guess < ok :
low = mid + 1
else:
high = mid - 1
return
binary_search( alist , num )
\ 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