Commit 47ae974e by BellCodeEditor

auto save

parent 6f2fa3fa
Showing with 2 additions and 2 deletions
......@@ -6,9 +6,9 @@ for i in range(1, 101):
num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
low=0
low=0 #定义变量
high=len(alist)-1
while low <= high:
while low <= high: #
mid=(low+high)//2
guess=alist[mid]
if guess==num:
......
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