Binary Search in Python(Iterative version)

binarySearch.py

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

result = int(binarySearch([1,2,3,4,5],0))

if result!=0: print("element found at", result)
else: print("Element not found!")