Exercise_1.py

# Python code to implement iterative Binary  
# Search. 
  
# It returns location of x in given array arr  
# if present, else returns -1 
def binarySearch(arr, l, r, x): 
   if l<=r :
    #write your code here
    mid= (l+r)//2
    if x== arr[mid]:
        return mid
    elif x >arr[mid]:
        #l= mid+1
        return binarySearch(arr, mid+1, r, x)
    else:
        #r= mid-1
        return binarySearch(arr, l, mid-1, x)
   else: 
      return -1
  
# Test array 
arr = [ 2, 3, 4, 10, 40 ] 
x = 10
  
# Function call 
result = binarySearch(arr, 0, len(arr)-1, x) 
  
if result != -1: 
    print(f"Element is present at index: {result}")
else: 
    print ("Element is not present in array")