Fibonacci Series in C++ without Recursion, using recursion

转载于 2019-05-17 14:40:00 发布 · 88 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/poission/p/10881225.html

文章标签：

#c/c++

博客给出了用C/C++语言实现斐波那契数列的代码，包含非递归和递归两种方式。非递归方式通过循环计算并输出数列，递归方式则利用函数自身调用实现。代码中接收用户输入的元素数量，然后输出相应的斐波那契数列。

// without Recursion

#include <iostream>
using namespace std;
int main() {
int n1=0,n2=1,n3,i,number;
cout<<"Enter the number of elements: ";
cin>>number;
cout<<n1<<" "<<n2<<" "; //printing 0 and 1

for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already printed
{
n3=n1+n2;
cout<<n3<<" ";
n1=n2;
n2=n3;
}

return 0;
}

// using recursion

#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 number of elements: ";
cin>>n;
cout<<"Fibonacci Series: ";
cout<<"0 "<<"1 ";
printFibonacci(n-2); //n-2 because 2 numbers are already printed
return 0;
}

转载于:https://www.cnblogs.com/poission/p/10881225.html