Fibonacci series in c++ Recursive

#include<iostream>
using namespace std;
int fib(int n) {
   if (n <= 1)
   return n;
   return fib(n-1) + fib(n-2);
}
int main () {
   int n = 10, i;
   for(i=0;i<n;i++)
   cout<<fib(i)<<" ";
   return 0;
}

Source: tutorialspoint.com

Similar codes

0 vote199 views1 answer
Strong number in c++
C++
22 votes246 views6 answers
Sort array in descending order c++
C++
0 vote193 views1 answer
C++ read matttrix from text file
C++
-1 vote194 views1 answer
Un aliment traduction espagnol
C++
0 vote295 views1 answer
C++ generic pointer
C++
5 votes204 views3 answers
Int to float c++
C++
0 vote254 views1 answer
C++ find index of all occurrences in string
C++
6 votes191 views1 answer
How to dynamically allocate an array c++
C++
5 votes198 views3 answers
Remove space in string c++
C++
18 votes207 views4 answers
Array length c++
C++