mirror of
https://github.com/c0de-archive/hacktoberfest-2018.git
synced 2024-11-13 08:27:25 +00:00
20 lines
366 B
Python
20 lines
366 B
Python
|
def binary(a, tv):
|
||
|
|
minimum = 0
|
||
|
|
maximum = len(a) - 1
|
||
|
|
while minimum < maximum:
|
||
|
|
guess = round((minimum + maximum)/2)
|
||
|
|
if a[guess] == tv:
|
||
|
|
return guess
|
||
|
|
elif a[guess] < tv:
|
||
|
|
minimum = guess + 1
|
||
|
|
else:
|
||
|
|
maximum = guess - 1
|
||
|
|
return -1
|
||
|
|
|
||
|
|
|
||
|
|
arr = []
|
||
|
|
|
||
|
|
ind = binary(arr, 4)
|
||
|
|
print("index:")
|
||
|
|
print(ind)
|