Binary Search in Python(Recursive version)

binarySearchRecursive.py

def binarySearch(arr, key, low, high):
    if low>high:
        return False
    else:
        mid = (low+high)/2  
        if arr[mid]==key:
            return True
        elif key<arr[mid]:
            return binarySearch(arr,key,low,mid-1)
        else:          
            return binarySearch(arr,key,mid+1,high)

result = binarySearch([1,2,3,4,5],6,0,4)
if result: print("Element found!")
else: print("Element not found!")