def binsearch(data, left, right, searched): 
    if left <= right:
        current = (left + right) // 2
        if data[current] == searched:
            return current
        elif data[current] > searched:
            return binsearch(data, left, current-1, searched)
        else: 
            return binsearch(data, current+1, right, searched)
    else: 
        return -1