Question

Must be written in JAVA Code

Modify Fig. 19.2 to use recursive method recursiveLinear-Search to perform a linear search of the array. The method should receive the search key and starting index as arguments. If the search key is found, return its index in the array; otherwise, return –1. Each call to the recursive method should check one index in the array.

Figure 19.2

import java.security.SecureRandom;

import java.util.Arrays;

import java.util.Scanner;

public class LinearSearchTest{

public static int linearSearch(int data[], int searchKey) {

for (int index = 0; index < data.length; index++) {

if (data[index] == searchKey) {

return index;

}

}

return -1;

}

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

SecureRandom generator = new SecureRandom();

int[] data = new int [10];

for (int i = 0; i < data.length; i++) {

data[i] = 10 + generator.nextInt(90);

}

System.out.printf("%s%n%n", Arrays.toString(data));

System.out.print("Please enter an integer value (-1 to quit): ");

int searchInt = input.nextInt();

while (searchInt != -1) {

int position = linearSearch(data, searchInt);

if (position == -1) {

System.out.printf("%d was not found%n%n", searchInt);

}

else {

System.out.printf("%d was found in position %n%n", searchInt, position);

}

System.out.print("Please enter an integer value (-1 to quit): ");

searchInt = input.nextInt();

}

}

}

Answer 1

If you have any doubts, please give me comment...

import java.security.SecureRandom;

import java.util.Arrays;

import java.util.Scanner;

public class LinearSearchTest {

    public static int linearSearch(int data[], int searchKey, int startingIndex) {

        if(startingIndex==data.length)

            return -1;

        if(data[startingIndex]==searchKey)

            return startingIndex;

        return linearSearch(data, searchKey, startingIndex+1);

    }

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);

        SecureRandom generator = new SecureRandom();

        int[] data = new int[10];

        for (int i = 0; i < data.length; i++) {

            data[i] = 10 + generator.nextInt(90);

        }

        System.out.printf("%s%n%n", Arrays.toString(data));

        System.out.print("Please enter an integer value (-1 to quit): ");

        int searchInt = input.nextInt();

        while (searchInt != -1) {

            int position = linearSearch(data, searchInt, 0);

            if (position == -1) {

                System.out.printf("%d was not found%n%n", searchInt);

            } else {

                System.out.printf("%d was found in position %d%n%n", searchInt, position);

            }

            System.out.print("Please enter an integer value (-1 to quit): ");

            searchInt = input.nextInt();

        }

    }

}