Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question
1 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 arra
2 First index means, the index of first occurrence of x in the input array.
3
Do this recursively. Indexing in the array starts from 0.
4
Input Format :
5
Line 1: An Integer N i.e. size of array
6
Line 2
7
Line 3 Integer x
8
Output Format :
9
first index or -1
10
Constraints :
11
1 <= N <= 10^3
12
Sample Input :
13
4
14 9 8 10 8
15 8
N integers which are elements of the array, separated by spaces.
16 Sample Output:
17
1
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
Solution: /////////
public class Solution {
}
public static int firstIndex(int input[], int x, int startIndex) {
if(startIndex==input. length) {
return -1;
}
if(input[start Index] ==x){
}
return startIndex;
}
return firstIndex(input, x, startIndex+1);
public static int firstIndex(int input[], int x) {
return firstIndex (input, x, 0);
expand button
Transcribed Image Text:1 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 arra 2 First index means, the index of first occurrence of x in the input array. 3 Do this recursively. Indexing in the array starts from 0. 4 Input Format : 5 Line 1: An Integer N i.e. size of array 6 Line 2 7 Line 3 Integer x 8 Output Format : 9 first index or -1 10 Constraints : 11 1 <= N <= 10^3 12 Sample Input : 13 4 14 9 8 10 8 15 8 N integers which are elements of the array, separated by spaces. 16 Sample Output: 17 1 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 Solution: ///////// public class Solution { } public static int firstIndex(int input[], int x, int startIndex) { if(startIndex==input. length) { return -1; } if(input[start Index] ==x){ } return startIndex; } return firstIndex(input, x, startIndex+1); public static int firstIndex(int input[], int x) { return firstIndex (input, x, 0);
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY