simple recursive binary search implementation

binarysearch.py

import math

def binarysearch(arr, key, low, high):
    if low > high:
        return -1

    mid = math.floor((high+low)/2)

    if arr[mid] == key:
        return mid

    if arr[mid] > key:
        return binarysearch(arr, key, low, mid-1)
    else:
        return binarysearch(arr, key, mid+1, high)

@bambooozeld