Commit 0953f336 by BellCodeEditor

save project

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