-
Notifications
You must be signed in to change notification settings - Fork 1
/
Fibonacci.cpp
33 lines (22 loc) · 875 Bytes
/
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
/*
The fibonacci sequence is a famous bit of mathematics, and it happens to have a recursive definition. The first two values in the sequence are 0 and 1 (essentially 2 base cases). Each subsequent value is the sum of the previous two values, so the whole sequence is: 0, 1, 1, 2, 3, 5, 8, 13, 21 and so on. Define a recursive fibonacci(n) method that returns the nth fibonacci number, with n=0 representing the start of the sequence.
fibonacci(0) → 0
fibonacci(1) → 1
fibonacci(2) → 1
*/
#include<iostream>
using namespace std;
int fibonacci(int n){
if(n == 0)
return 0;
if(n == 1)
return 1;
return fibonacci(n-1) + fibonacci(n-2);
}
int main(){
cout << "Enter The Number : ";
int number;
cin >> number;
std::cout << "Nth Fibonacci number for " << number << " is : " << fibonacci(number) << endl;
return 0;
}