-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtype of recursion .cpp
108 lines (89 loc) · 1.51 KB
/
type of recursion .cpp
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
//types of recursion
//tail recursion
/* #include <iostream>
using namespace std;
void fun(int n)
{
while(n>0)
{
cout<<n;
n--;
}
}
int main(){
int x=3;
fun(x);
return 0;
}
#include <iostream>
using namespace std;
void fun(int n)
{
if(n>0)
{
cout<<n;
fun(n-1);
}
}
int main(){
int x=3;
fun(x);
return 0;
}
//tree reecursion
#include <iostream>
using namespace std;
void fun(int n)
{
if(n>0)
{ cout<<n;
fun(n-1);
fun(n-1);
}
}
int main(){
int x=3;
fun(x);
return 0;
}
//nested recursion
#include <iostream>
using namespace std;
int fun(int n)
{
if(n>100)
return n-10;
else
return fun(fun(n+11));
}
int main(){
int x=3;
int r=fun(x);
cout<<r;
return 0;
}*/
//indirect recursion
#include <iostream>
using namespace std;
void funB(int n);
void funA(int n)
{
if(n>0)
{
cout<<n<<endl;
funB(n-1);
}
}
void funB(int n)
{
if (n>1)
{
cout<<n<<endl;
funA(n/2);
}
}
int main(){
int x=20;
funA(x);
return 0;
}