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 vote155 views1 answer
130 divided by -10
C++
0 vote157 views2 answers
Stack data structure c++
C++
1 vote171 views1 answer
How to get 4 decimal places in c++
C++
1 vote174 views1 answer
Collections c# vs c++
C++
0 vote177 views3 answers
Get number round off to two decimal places c++
C++
0 vote174 views1 answer
Extra parameter in comparator function for sort
C++
1 vote150 views1 answer
C++ builder
C++
0 vote192 views1 answer
How to choose struct's endianness cpp
C++
3 votes170 views1 answer
Cpp boilerplate
C++
1 vote183 views1 answer
Qstring get if empty
C++