-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindIndexOfANumberInAnArray_Question.java
More file actions
68 lines (61 loc) · 1.87 KB
/
FindIndexOfANumberInAnArray_Question.java
File metadata and controls
68 lines (61 loc) · 1.87 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
// First Index Of a Number in an Array - Question
// Send Feedback
// Given an array of length N and an integer x, you need to find and return the first index of integer x present in the array. Return -1 if it is not present in the array.
// First index means, the index of first occurrence of x in the input array.
// Do this recursively. Indexing in the array starts from 0.
// Input Format :
// Line 1 : An Integer N i.e. size of array
// Line 2 : N integers which are elements of the array, separated by spaces
// Line 3 : Integer x
// Output Format :
// first index or -1
// Constraints :
// 1 <= N <= 10^3
// Sample Input :
// 4
// 9 8 10 8
// 8
// Sample Output :
// 1
import java.util.Scanner;
/**
* FindIndexOfANumberInAnArray_Question
*/
public class FindIndexOfANumberInAnArray_Question {
public static void takeInput(int input[], int n, Scanner s) {
System.out.println("Enter values of the array : ");
for (int i = 0; i < n; i++) {
input[i] = s.nextInt();
}
}
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
System.out.print("Enter length of the array : ");
int n = s.nextInt();
int input[] = new int[n];
takeInput(input, n, s);
System.out.println("Enter x : ");
int x = s.nextInt();
int ans = firstIndex(input, x);
System.out.println("Output : " + ans);
s.close();
}
public static int firstIndex(int input[], int x) {
if (input.length == 0) {
return -1;
}
if (input[0] == x) {
return 0;
}
int arr[] = new int[input.length - 1];
for (int i = 1; i < input.length; i++) {
arr[i - 1] = input[i];
}
int fi = firstIndex(arr, x);
if (fi == -1) {
return -1;
} else {
return fi + 1;
}
}
}