Commit 798956cb by BellCodeEditor

save project

parent 00064db4
Showing with 20 additions and 0 deletions
bingo_num = 20
num_list = [1,3,5,8,11,15,17,18,20,21]
def binary_search(alist,num)
low = 0
high = len(alist)-1
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
result = binary_search(num_list,20)
print(result)
\ 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