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 vote264 views1 answer
How to declare a 2D vector in c++ of size m*n with value 0
C++
7 votes270 views5 answers
Sleep c++
C++
0 vote246 views1 answer
Split a number and store it in vector
C++
0 vote247 views1 answer
How to make a number always positive in c++
C++
0 vote281 views1 answer
Print elements of linked list
C++
-1 vote266 views1 answer
How to make sound in c++
C++
0 vote275 views1 answer
C++ compare time
C++
0 vote259 views1 answer
C++ suare
C++
0 vote304 views1 answer
Play audio c++
C++
0 vote248 views1 answer
Compute the average of an array c++
C++