Java Program To Recursively Linearly Search An Element In An Array

// Java Program to Search an element in an Array Recursively

// Main class
public class Geeks
{
    // Method 1
    // Recursive method to search for an element and
    // its index in the array
    static int recursiveSearch(int arr[], int l, int r,
                               int x)
    {
        // if r<l,it means that element is not present in
        // the array
        if (r < l)
            return -1;

        if (arr[l] == x)
            return l;

        if (arr[r] == x)
            return r;

        // Since element has not found on both left most and
        // rightmost boundary,ie at l and r, now recursive the
        // array to find position of x.
        return recursiveSearch(arr, l + 1, r - 1, x);
    }

    // Method 2
    // Main driver method
    public static void main(String[] args)
    {
        // Element to be searched for
        // Custom input number
        int x = 3;

        // Declaring and initializing the integer array
        int arr[] = new int[] { 25, 60, 18, 3, 10 };

        // Calling the above recursive method method to
        // search for the element in the array

        // Recursive function is called over array to
        // get the index of the element present in an array
        int index
        = recursiveSearch(arr, 0, arr.length - 1, x);

        // If index is found means element exists
        if (index != -1)

            // Print the element and its index
            System.out.println("Element " + x
                               + " is present at index "
                               + index);

        // If we hit else case means
        // element is not present in the array
        else

            // Simply display the corresponding element
            // is not present
            System.out.println("Element " + x
                               + " is not present");
    }
}