Cacher is the code snippet organizer for pro developers

int binary_search(int* tab, int first, int last, int to_find)
{
    int middle;

    if (last >= first) {
        middle = first + (last - first) / 2;
        if (tab[middle] == to_find) {
            return (middle);
        }
        else if (tab[middle] > to_find) {
            return (binary_search(tab, first, middle - 1, to_find));
        }
        else {
            return (binary_search(tab, middle + 1, last, to_find));
        }
    }
    return (-1);
}