return -1;
int middle = (first + last) / 2;
if (value == int_array[middle])
return middle;
else if (value > int_array[middle])
return binarySearch((middle + 1), last, value);
return -1;
int middle = (first + last) / 2;
if (value == int_array[middle])
return middle;
else if (value > int_array[middle])
return binarySearch((middle + 1), last, value);