Question

Write and implement a recursive version of the sequential search algorithm. Test the algorithm with an array that have ten integer values, user can enter the values or assigned the values to the array in the main method. The search key should be a value in the array or not in the array. JAVA!!!

Answer 1

public class LinearSearch {
   public static void main(String[] args) {
       int arr[]= {10,24,12,5,26,33,45,21};
       int key=21;
       int index=linear_search_rec(arr, arr.length-1, key);
       if(index==-1) {
           System.out.println(key+" does not exist in array");
       }
       else {
           System.out.println(key+" found at index "+index);
       }
      
       key=29;
       index=linear_search_rec(arr, arr.length-1, key);
       if(index==-1) {
           System.out.println(key+" does not exist in array");
       }
       else {
           System.out.println(key+" found at index "+index);
       }
   }
   public static int linear_search_rec(int arr[], int n ,int key){
       if(n<0) { // Base case - not found
       return -1;
       }
       if(arr[n]==key) { // Base case - found
       return n;
       }
       // Recursive case
       return linear_search_rec(arr, n-1, key);
       }
}

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me