-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRecursionDemo.java
More file actions
133 lines (96 loc) · 1.83 KB
/
Copy pathRecursionDemo.java
File metadata and controls
133 lines (96 loc) · 1.83 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
public class RecursionDemo {
public static void main(String[] args) {
// PD(5);
// PI(5);
// PDI(5);
// PDIskip(5);
// System.out.println(factorial(4));
// System.out.println(Power(2, 8));
// System.out.println(fib(10));
// int[] arr = { 3, 8, 6, 1, 9, 7 };
// System.out.println(isSorted(arr, 0));
int[] arr = { 6, 8, 1, 1, 8, 3, 4 };
System.out.println(firstIndex(arr, 0, 1));
}
public static void PD(int n) {
if (n == 0) {
return;
}
System.out.println(n);
PD(n - 1);
}
public static void PI(int n) {
if (n == 0) {
return;
}
PI(n - 1);
System.out.println(n);
}
public static void PDI(int n) {
if (n == 0) {
return;
}
System.out.println(n);
PDI(n - 1);
System.out.println(n);
}
public static void PDIskip(int n) {
if (n == 0) {
return;
}
if (n % 2 == 1) {
System.out.println(n);
}
PDIskip(n - 1);
if (n % 2 == 0) {
System.out.println(n);
}
}
public static int factorial(int n) {
if (n == 1) {
return 1;
}
int fnm1 = factorial(n - 1);
int fn = n * fnm1;
return fn;
}
public static int Power(int x, int n) {
if (n == 0) {
return 1;
}
int pnm1 = Power(x, n - 1);
int pw = x * pnm1;
return pw;
}
public static int fib(int n) {
if (n == 1 || n == 0) {
return n;
}
int fnm1 = fib(n - 1);
int fnm2 = fib(n - 2);
int fn = fnm1 + fnm2;
return fn;
}
public static boolean isSorted(int[] arr, int si) {
if (si == arr.length - 1) {
return true;
}
if (arr[si] > arr[si + 1]) {
return false;
} else {
boolean restAns = isSorted(arr, si + 1);
return restAns;
}
}
public static int firstIndex(int[] arr, int si, int data) {
if (si == arr.length) {
return -1;
}
if (arr[si] == data) {
return si;
} else {
int restAns = firstIndex(arr, si + 1, data);
return restAns;
}
}
}