recursiveImplementationBinarySearch.py

def binarySearch (list, l, r, target): 
  
    # Check base case 
    if r >= l: 
  
        mid = l + (r - l)/2
  
        # If element is present at the middle itself 
        if arr[mid] == target: 
            return mid 
          
        # If element is smaller than mid, then it can only 
        # be present in left half of the list 
        elif arr[mid] > target: 
            return binarySearch(arr, l, mid-1, target) 
  
        # Else the element can only be present in right half of the list  
        else: 
            return binarySearch(arr, mid+1, r, target) 
  
    else: 
        # Element is not present in the list 
        return -1