-
Notifications
You must be signed in to change notification settings - Fork 49
/
Fibonacci.cpp
61 lines (53 loc) · 1.31 KB
/
Fibonacci.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
#include <iostream>
using namespace std;
int main() {
//Initialize no.of terms to zero
//And term1=0,term=1,next term=0
int n, t1 = 0, t2 = 1, nextTerm = 0;
//Taking no.of terms as input from user
cout << "Enter the number of terms: ";
cin >> n;
cout << "Fibonacci Series: ";
//Generating fibonacci sequence
for (int i = 1; i <= n; ++i) {
// Prints the first two terms.
if(i == 1) {
cout << t1 << ", ";
continue;
}
if(i == 2) {
cout << t2 << ", ";
continue;
}
//Now,next item value becomes sum of current_value+previous_value
nextTerm = t1 + t2;
//Now term1 value changes to term2 and term2 value changes to term1
t1 = t2;
t2 = nextTerm;
//Print the above next item value
cout << nextTerm << ", ";
//Go to next iteration
}
return 0;
}
//BETTER APPROACH WITH HELP OF RECURSION
#include <iostream>
using namespace std;
int fib(int x) {
if((x==1)||(x==0)) {
return(x);
}else {
return(fib(x-1)+fib(x-2));
}
}
int main() {
int x , i=0;
cout << "Enter the number of terms of series : ";
cin >> x;
cout << "\nFibonnaci Series : ";
while(i < x) {
cout << " " << fib(i);
i++;
}
return 0;
}