Recursive program to find an element in an array linearly.

Following is a Java program to find an element in an array linearly.

Example

 Live Demo

import java.util.Scanner;
public class SearchingRecursively {
   public static boolean searchArray(int[] myArray, int element, int size){
      if (size == 0){
         return false;
      }
      if (myArray[size-1] == element){
         return true;
      }
      return searchArray(myArray, element, size-1);
   }
   public static void main(String args[]){
      System.out.println("Enter the required size of the array: ");
      Scanner s = new Scanner(System.in);
      int size = s.nextInt();
      int myArray[] = new int [size];
      System.out.println("Enter the elements of the array one by one ");
      for(int i=0; i<size; i++){
         myArray[i] = s.nextInt();
      }
      System.out.println("Enter the element to be searched: ");
      int target = s.nextInt();
      boolean bool = searchArray(myArray, target ,size);
      if(bool){
         System.out.println("Element found");
      }else{
         System.out.println("Element not found");
      }
   }
}

Output

Enter the required size of the array:
5
Enter the elements of the array one by one
14
632
88
98
75
Enter the element to be searched:
632
Element found