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

3 votes96 views1 answer
C++ check if string contains uppercase
C++
2 votes111 views1 answer
C++ primality test
C++
0 vote97 views1 answer
Cpp fread
C++
4 votes108 views3 answers
Converting char to int in c++
C++
14 votes102 views3 answers
Initialising 2d vector
C++
0 vote94 views1 answer
Glm has no member value_ptr
C++
0 vote101 views1 answer
Find N Unique Integers Sum Up to Zero
C++
0 vote116 views1 answer
Operator overloading outside class
C++
1 vote101 views1 answer
STD::ERASE FUNCTION IN C++
C++
0 vote94 views2 answers
Default order in set in c++
C++