Commit 1a4bf3a1 by BellCodeEditor

save project

parent 3108c8b6
Showing with 10 additions and 0 deletions
import random
alist = []
for i in range(1, 101):
alist.append(i)
......@@ -7,3 +8,11 @@ num = random.choice(alist)
# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
def binary_search(alist,num):
low=0
high=len(alist)-1
while low<high:
mid=(low+high)//2
gurss=alist[mid]
if :
return mid
\ 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