Skip to content

Administrator / level3-lesson16-diy2

Go to a project
Commit c360dacd by BellCodeEditor
Options

save project

parent 74bbfa37
Inline Side-by-side
Showing with 1 additions and 1 deletions
my_search.py
...@@ -12,7 +12,7 @@ def binary_search(alist,num): ...@@ -12,7 +12,7 @@ def binary_search(alist,num):
while minIndex<=maxIndex: while minIndex<=maxIndex:
mid=(minIndex+minIndex)//2 mid=(minIndex+minIndex)//2
if alist[mid]==num if alist[mid]==num:
return mid return mid
elif alist[mid]>mid: elif alist[mid]>mid:
maxIndex=mid-1 maxIndex=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