Commit ab3cc88a by BellCodeEditor

save project

parent 8e2b4345
Showing with 1 additions and 0 deletions
......@@ -11,6 +11,7 @@ def binary_search(alist,num):
high=len(alist)-1
while low<high:
mid=(low+high)//2
guess=alist[mid]
if guess==num:
return mid
elif 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