Commit 26c040a1 by BellCodeEditor

save project

parent d665a849
Showing with 12 additions and 4 deletions
......@@ -9,6 +9,14 @@ num = random.choice(alist)
def binary_search(alist,num):
low = 0
high = len(alist)-1
mid = (low+high)//2
guess = alist_mid
if
\ No newline at end of file
while low <= high:
mid = (low+high)//2
guess = alist[mid]
if guess == num:
return mid
elif guess<num:
low = mid+1
else:
high = mid-1
return None
print( binary_search(alist,num) )
\ 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