用递归实现斐波那契数列(Fibonacci Sequence )的函数

 

#include<iostream>

using namespace std;

void fn(int aa[],int n,int m)

{

    if(n == 0 || n == 1)

        aa[n]=1;

    if(n > 1)

        aa[n] = aa[n-1] + aa[n-2];

    if (n<m)

    {

        fn(aa,n+1,m);

    }

}

 

int main()

{

    int m = 0;

    int n ,i;

    int aa[20]={0};

    cout<<"please input n:/n";

    cin >> n;

    fn(aa,0,n);

    for(i = 0; i < n; i++)

        cout<<aa[i]<<" ";

    cout << endl;

    return 0;

}