nvjkmr

/* 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);