Binary Search Algorithm (Java)

        public int findBinary(int[] array, int min, int max, int item)
{
if (min > max)
return -1;
int mid = min + (max - min)/2;
if (array[mid] == item)
return mid;
else if (array[min] < array[mid] && item < array[mid])
return findBinary(array, min, mid, item);
else if (array[max] > array[mid] && item > array[mid])
return findBinary(array, mid, max, item);
else
return -1;
}