BinarySearchRecursive.java

class BinarySearch 
{
    public static int binarySearchRecursive(int[] list, int first, int last, int key) 
    {
        if(first >= last) 
        {
            return -1;
        }
        int middle = first + (last - first) / 2;
        if(list[middle] == key) 
        {
            return middle;
        } 
        else if(list[middle] < key) 
        {
            first = middle + 1;
            return binarySearchRecursive(list, first, last, key);
        }        
        else 
        {
            last  = middle - 1;
            return binarySearchRecursive(list, first, last, key);
        }
    }
 
    public static void main(String[] args) 
    {
        int[] list = {10, 14, 19, 26, 27, 31, 33, 35, 42, 44};
        int element = 31;
        int result = binarySearchRecursive(list, 0, list.length - 1, element);
        if(result == -1) 
        {
            System.out.println("The element does not exist in the list");
        }
        else 
        {
            System.out.println("The element found at index : " + result);
        }
    }
}