Divide and conquer search for sorted integer array

divideAndConquer.h

/* Divide and conquer search for sorted integer array.
 * Pre:  Takes array pointer
 *       Integer to find
 *       Last index of array
 *       Initial of array
 * Return: Index of the array
 */
int divideAndConquer(int* arr, int toFind, int lastIndex, int initialIndex) {

        int mid = initialIndex + ((lastIndex - initialIndex) / 2);

        if(*(arr+mid) == toFind) {
                printf("%d is equal to %d mid: %d\n", toFind, *(arr+mid), mid);
                return mid;
        } else if(*(arr+mid) < toFind) {
                printf("%d is greater than %d mid: %d\n", toFind, *(arr+mid), mid);
                // find between mid & length
                return divideAndConquer(arr, toFind, lastIndex, mid+1);
        } else if(*(arr+mid) > toFind) {
                printf("%d is less than %d mid: %d\n", toFind, *(arr+mid), mid);
                // find between 0 & mid
                return divideAndConquer(arr, toFind, initialIndex, mid-1);
        }

        return -1;
}