# Java Program To Recursively Linearly Search An Element In An Array

• Difficulty Level : Medium
• Last Updated : 24 Jul, 2022

Given an array arr[] of n elements, write a function to recursively search a given element x in arr[].

Illustration:

```Input  : arr[] = {25, 60, 18, 3, 10}
Output : Element to be searched : 3

Input  : arr[] = {10,20,30,24,15,40}
Output : -1
For x = 35
Element x is not present in arr[]```

Procedure:

The idea is to search the element from both the sides of array recursively. If the element that needs to searched matches with the leftmost element of the left boundary, or it matches with the rightmost element of the right boundary, directly return the position of the element, else recur for the remaining array to search for the element with the value same as x.

Example

## Java

 `// Java Program to Search an element in an Array Recursively` `// Main class``public` `class` `GFG {` `    ``// 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

Output

`Element 3 is present at index 3`

Time complexity: O(N2) where N is size of input array
Auxiliary Space : O(N)

My Personal Notes arrow_drop_up