Recursive Binary Search

[EternalSolitude]

I have to do a recursive binary search, and this is what I have:

// recursive version of binarySearch
public static Comparable binarySearchRecursive(int first, int last,
Comparable[] data,
Comparable target)
{
if (first < last)
{
int mid = first + (last - first) / 2;
if (data[mid].compareTo(target) < 0)
{
return binarySearchRecursive(mid + 1, last, data, target);
}
else if (data[mid].compareTo(target) > 0)
{
return binarySearchRecursive(mid - 1, last, data, target);

}

else
{
return mid;
}
}

return -(first + 1);

}
}

Am I on the right track?

[Eranga]

Did you test your code? What happen when you compile and run? Any errors? You should test your application first of all, then ask any questions/doubts here we'll help you to find the solution.

[EternalSolitude]

Yea it gave me a few errors, but the error didn't have to do with this code. It had to do with the code my instructor gave me to compile and with the help of this code when completed. idk if I got it to work properly or not, hopefully I get some points on it haha, thanks anyways