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

1 vote161 views1 answer
Qt double en qstring
C++
10 votes187 views2 answers
Why convert char* to string c++
C++
0 vote183 views1 answer
What is xor_eq c++
C++
1 vote181 views1 answer
Iterate vector from end to begin
C++
0 vote196 views1 answer
If not c++
C++
1 vote185 views1 answer
How to easily trim a str in c++
C++
3 votes177 views1 answer
Convert refference to pointer c++
C++
0 vote246 views1 answer
Rotate an array of n elements to the right by k steps
C++
2 votes233 views1 answer
C++ how to loop through a vector but not the last element
C++
10 votes203 views3 answers
C++ check if file exits
C++