maneedhar
10/8/2018 - 6:54 PM

Fibonacci with recursion

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int fibonacci ( int n ){
    if (n == 0){
        return 0;
    }
    if (n == 1){
        return 1;
    }else{
        return (fibonacci(n-1) + fibonacci(n-2));
    }
}

int main() {
    int n;
    cin>>n;
    for (int i=0; i<n; i++){
        cout<<fibonacci (i)<<" ";
    }
	return 0;
}