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 vote336 views1 answer
What is thread in c++
C++
0 vote303 views1 answer
Pascal's triangle in c++ through pointer
C++
0 vote305 views1 answer
How to get the last element of an array in C++ using std::array
C++
9 votes295 views5 answers
C++ cin cout
C++
0 vote368 views1 answer
C++ add to array
C++
1 vote331 views1 answer
Tarray ue4 c++
C++
5 votes344 views3 answers
Convert vector to set c++
C++
0 vote349 views2 answers
C++ code
C++
1 vote314 views1 answer
C++ find in pair
C++
0 vote343 views1 answer
C++ read each char of string
C++