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

20 votes270 views10 answers
Prime number c++
C++
-2 votes297 views6 answers
Array in c++
C++
0 vote320 views1 answer
Cpp how to add collisions to boxes
C++
0 vote304 views1 answer
How to generate number in c++
C++
0 vote347 views1 answer
Equalize problem codeforces
C++
0 vote332 views1 answer
High school hacking competition
C++
1 vote345 views1 answer
How to substract to give a positive outcome in c++
C++
14 votes362 views6 answers
Cout c++
C++
1 vote367 views2 answers
How to pause a c++ program.
C++
14 votes278 views1 answer
Dynamically generating 2d array in cpp
C++