-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDAY2.cpp
More file actions
148 lines (139 loc) · 2.04 KB
/
DAY2.cpp
File metadata and controls
148 lines (139 loc) · 2.04 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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
//POWER SUM
#include <iostream>
using namespace std;
int power(int m, int n)
{
if(n > 0)
{
return m * power(m, n-1);
}
else if (n == 0)
{
return 1;
}
else
{
exit(-1);
}
}
int main()
{
int m, n;
cin>>m>>n;
cout<<m<<" ^ "<<n<<" = "<<power(m, n);
return 0;
}
//SUM OF N TERMS
#include<iostream>
using namespace std;
int sum(int n)
{
if(n==0){
return 0;
}
int prevsum= sum(n-1);
return n + prevsum;
}
int main()
{
int n;
cin>>n;
cout<<sum(n);
}
//FIBONACCI SERIES
#include <iostream>
using namespace std;
int fibonacci(int n)
{
if(n<=1)
{
return n;
}
else
{
return fibonacci(n-2) + fibonacci(n-1);
}
}
int main()
{
int n;
cin>>n;
cout<<fibonacci(n)<<endl;
return 0;
}
//BINOMIAL EXPANSION
#include <iostream>
using namespace std;
int nCr(int n, int r)
{
int result;
if(r == 0)
{
result = 1;
}
else if(n == r)
{
result = 1;
}
else
{
result = nCr(n-1, r-1) + nCr(n-1, r);
}
return result;
}
int main()
{
int n, r;
cin>>n>>r;
cout<<nCr(n, r);
return 0;
}
//TAYLOR SERIES
#include<iostream>
using namespace std;
double taylor(int x,int n)
{
static double num=1;
static double den=1;
static double term;
if(n==0)
{
return 1;
}
else{
term=taylor(x,n-1);
num=num*x;
den=den*n;
return (term + num/den);
}
return 0;
}
double taylorLoop(int x,int n)//taylor series using loop
{
double tylor =1;
double num=1;
double den=1;
for(int i=1;i<=n;i++){
num*=x;
den*=i;
tylor +=(num/den);
}
return tylor;
}
double homer(double x,double n)//taylor series using homer formula
{
static double temp=1;
if(n==0){
return temp;
}
else{
temp=1+((x/n)*temp);
return homer(x,n-1);
}
}
int main()
{
cout<<taylor(1,10)<<endl;
cout<<taylorLoop(1,10)<<endl;
cout<<homer(1,10)<<endl;
}