递归与无递归实现斐波那契数列

不使用递归在C++中实现斐波那契数列。

#include <iostream>  
using namespace std;  
int main() {  
    int n1=0,n2=1,n3,i,number;    
    cout<<"Enter the numbers: ";    
    cin>>number;    
    cout<<n1<<" "<<n2<<" ";     
    for(i=2;i<number;++i) 
    {    
        n3=n1+n2;    
        cout<<n3<<" ";    
        n1=n2;    
        n2=n3;    
    }    
    return 0;  
}

得到结果 -
Enter the numbers: 7
0 1 1 2 3 5 8

在C++中使用递归实现斐波那契数列。

#include<iostream>    
using namespace std;      
void printFibonacci(int n){    
    static int n1=0, n2=1, n3;    
    if(n>0){    
         n3 = n1 + n2;    
         n1 = n2;    
         n2 = n3;    
         cout<<n3<<" ";    
         printFibonacci(n-1);    
    }    
}    
int main(){    
    int n;    
    cout<<"Enter the numbers: ";    
    cin>>n;    
    cout<<"Fibonacci Series: ";    
    cout<<"0 "<<"1 ";  
    printFibonacci(n-2); d    
     return 0;  
}

结果 -
Enter the numbers: 8
Fibonacci Series: 0 1 1 2 3 5 8 13