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

3 votes129 views2 answers
A+b+c whole square
C++
0 vote140 views1 answer
Youtube backlink generator tool
C++
10 votes145 views2 answers
C++ function inside main
C++
0 vote133 views1 answer
C++ preprocessor commands
C++
0 vote149 views1 answer
Program to swap max and min in matrix
C++
0 vote133 views1 answer
Softwareegg.courses4u
C++
0 vote131 views1 answer
Assegnare valori in c++
C++
-1 vote129 views1 answer
Longest increasing subsequence nlogn c++
C++
8 votes128 views5 answers
C++ vector resize
C++
0 vote146 views1 answer
All permutations with repetition C++
C++