You are viewing a single comment's thread. Return to all comments →
using namespace std;
int fibonacci(int n) {
if (n==0||n==1) return n; else return fibonacci(n-1)+fibonacci(n-2); }
int main() { int n; cin >> n; cout << fibonacci(n); return 0; }
Seems like cookies are disabled on this browser, please enable them to open this website
Recursion: Fibonacci Numbers
You are viewing a single comment's thread. Return to all comments →
include
using namespace std;
int fibonacci(int n) {
if (n==0||n==1) return n; else return fibonacci(n-1)+fibonacci(n-2); }
int main() { int n; cin >> n; cout << fibonacci(n); return 0; }