def bin_search_recursive(array, what_to_find, left=0, right=None):
    """
    Finds element in a sorted array using recursion.

    :param list array: A sorted list of values.
    :param what_to_find: An item to find.

    :returns: Index of the searchable item or -1 if not found.
    """
    right = right if right is not None else len(array) - 1
    if left > right:
        return -1  # Searchable not found

    middle_pos = (left + right) // 2
    if array[middle_pos] == what_to_find:
        return middle_pos

    if what_to_find < array[middle_pos]:
        return bin_search_recursive(array, what_to_find, left=left, right=middle_pos - 1)
    return bin_search_recursive(array, what_to_find, left=middle_pos + 1, right=right)