# code to implement iterative Binary Search.
def binarySearchIterative(arr, l, r, x):
while l <= r:
mid = l + (r - l) // 2;
if arr[mid] == x:
return mid
elif arr[mid] < x:
l = mid + 1
else:
r = mid - 1
return -1
arr = [ 4, 9, 8, 20, 80 ]
find = 80
result = binarySearchIterative(arr, 0, len(arr)-1, find)
if result != -1:
print ("Element is present at index % d" % result)
else:
print ("Element is not present in array")
"""Binary Search
Iterative
"""
def bin_iter(lst, item, low=0, high=None):
if high is None:
high = len(lst) - 1
while low <= high:
mid = (low + high) // 2
if item > lst[mid]: # To the left
low = mid + 1
elif item < lst[mid]: # To the right
high = mid - 1
else: # Found
return mid
return [] # Not found