devops-exercises/coding/python/binary_search.py

25 lines
607 B
Python
Raw Normal View History

2019-12-02 19:54:31 +01:00
#!/usr/bin/env python
import random
2019-12-20 18:11:43 +01:00
rand_num_li = sorted([random.randint(1, 50) for _ in range(10)])
2019-12-02 19:54:31 +01:00
target = random.randint(1, 50)
2019-12-20 18:11:43 +01:00
2020-01-17 13:45:07 +01:00
def binary_search(arr, lb, ub, target):
if lb <= ub:
mid = ub + lb // 2
if arr[mid] == target:
2019-12-02 19:54:31 +01:00
return mid
2020-01-17 13:45:07 +01:00
elif arr[mid] < target:
return binary_search(arr, mid + 1, ub, target)
2019-12-02 19:54:31 +01:00
else:
2020-01-17 13:45:07 +01:00
return binary_search(arr, lb, mid - 1, target)
2019-12-02 19:54:31 +01:00
else:
return -1
print("List: {}\nTarget: {}\nIndex: {}".format(
rand_num_li, target,
binary_search(rand_num_li, 0, len(rand_num_li) - 1, target)))