fibonacci.c

《数据结构-使用C语言》第三版

//fibonacci数列
#include<stdio.h>
long Fib1(int n)
{
	if(n==0||n==1)return n;
	else return Fib1(n-1)+Fib1(n-2);
}

long Fib2(int n)
{
	long int oneBack, twoBack, current;
	int i;
	if(n==0||n==1)return n;
	else 
	{
		oneBack=1;
		twoBack=0;
		for(i=2;i<=n;i++)
		{
			current=oneBack+twoBack;
			twoBack=oneBack;
			oneBack=current;
		}
		return current;
	}
}

int mian()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		printf("%d %d\n",Fib1(n),Fib2(n));
	}
	return 0;
}