-
Notifications
You must be signed in to change notification settings - Fork 0
/
recursionbasics.java
97 lines (70 loc) · 1.86 KB
/
recursionbasics.java
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
public class recursionbasics {
public static void printnumdescending(int n){
if(n==0){
return;
}
System.out.println(n);
printnumdescending(n-1);
}
public static void printnumascending(int n){
if(n==0){
return;
}
printnumascending(n-1);
System.out.println(n);
}
public static void printsumnaturalnum(int sum,int n){
if(n==0){
System.out.println(sum);
return;
}
sum=sum+n;
printsumnaturalnum(sum,n-1);
}
public static int factorialnumber(int n){
if(n==0){
return 1;
}
return n*factorialnumber(n-1);
}
public static void fibonacci(int x,int y,int j){
if(j==0){
return;
}
System.out.print(x+" ");
fibonacci(y,x+y,j-1);
}
// Print x^n (with stack height = n)
public static int exponentheight(int n,int ex){
if(n==0){
return 0;
}
if(ex==0){
return 1;
}
return n*exponentheight(n,ex-1);
}
public static int logexponentheight(int n,int ex){
if(n==0){
return 0;
}
if(ex==0){
return 1;
}
if(ex%2!=0){
ex=ex-1;
return logexponentheight(n,ex/2)*logexponentheight(n,ex/2)*n;
}else{
return logexponentheight(n,ex/2)*logexponentheight(n,ex/2);
}
}
public static void main(String []args){
// printnumascending(10);
// printnumdescending(5);
// printsumnaturalnum(0,5);
// System.out.println(factorialnumber(5));
// fibonacci(0,1,10);
// System.out.println(exponentheight(5,4));
System.out.println(logexponentheight(2,11));
}
}