斐波那契的递归算法 c语言,C语言实现斐波那契数列递归和非递归算法

// c_dataStructure.cpp : 定义控制台应用程序的入口点。

//

#include "stdafx.h"

#include

using namespace std;

int Fab_re(int n) {

long f;

if (n < 0) {

cout << "Please make sure your input is right!" << endl;

}

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

f = 1;

}

else {

f = Fab_re(n - 1) + Fab_re(n - 2);

}

return f;

}

void Fab_nonre(int n) {

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

cout << "1";

}

long int f_current = 0, f_backone = 1, f_backtwo = 1;

cout << " 1 ";

for (int i = 2; i <= n; i++) {

f_current = f_backone + f_backtwo;

f_backtwo = f_backone;

f_backone = f_current;

cout << " " << f_current << " ";

if (i % 5 == 0) {

cout << "\n";

}

}

}

int main()

{

int i, c1, c2, n;

cout << "please input your num:" << endl;

cin >> n;

for (i = 1; i <= n; i++) {

c1 = Fab_re(i);

cout << " " << c1 << " ";

if (i % 5 == 0) {

cout << "\n";

}

}

Fab_nonre(n);

return 0;

}