DSA/DAY1.cpp at master · devumang096/DSA · GitHub

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
//Pascal Triangle
#include<iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int pascal=1;
    for(int i=0;i<n;i++){
        for(int j=1;j<=n-i;j++){
            cout<<" ";
        }
        for(int j=0;j<=i;j++){
            if(i==0 || j==0){
                pascal=1;
            }
            else{
                pascal=pascal *(i-j+1)/j;
            }
            cout<<pascal<<" ";
        }
        cout<<endl;
    }
}

//RECURSION
#include<iostream>
using namespace std;

void fun(int n){
    if(n>0){
        cout<<n<<" ";
        fun(n-1);
        cout<<n<<" ";
    }
}
int main()
    int n;
{
    cin>>n;
    fun(n);
}

//NESTED RECURSION
#include<iostream>
using namespace std;

int fun(int n)
{
    if(n>0){
        cout<<n<<" ";
        fun(fun(n-1));
    }
    return n;
}
int main()
{
 fun(3);
}

//FACTORIAL
#include<iostream>
using namespace std;
int factorial(int n)
{
   if(n==1 || n==0)
   {
       return 1;
   }
   else {
       return n*factorial(n-1);
   }
}
int main()
{
    cout<<factorial(5);
}