FilesExpand file tree

 BackTracking

/

PracticeQs1.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

23 lines (16 loc) · 592 Bytes

 BackTracking

/

PracticeQs1.java

Copy path

Top

File metadata and controls

• Code
• Blame

23 lines (16 loc) · 592 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

// For a given integer array of size N.You have to find all the occurrences (indices) of a given element(Key) and print them. Use a recursive function to solve this problem.

public class PracticeQs1 {

static void occurrence(int arr[], int key, int i) {

if (i == arr.length)

return;

if (arr[i] == key) {

System.out.print(i + " ");

}

occurrence(arr, key, i + 1);

}

public static void main(String[] args) {

int arr[] = { 3, 2, 4, 5, 6, 2, 7, 2, 2 };

int key = 2;

occurrence(arr, key, 0);

}

}