C语言代码之描述第n个斐波那契数字（两种方法）

一.递归法 

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>



递归法
int Fib(int n)
{
	if (n <= 2)
		return 1;
	else
		return Fib(n - 1) + Fib(n - 2);
}

int main()
{
	int n = 0;
	int ret = 0;
	scanf("%d", &n);
	//TDD-测试驱动
	ret = Fib(n);
	printf("ret=%d\n", ret);
	return 0;
}

二.循环法

int Fib(int n)
{
	int a = 1;
	int b = 1;
	int c = 1;
	while (n > 2)
	{
		c = a + b;
		a = b;
		b = c;
		n--;
	}
	return c;
}
int main()
{
	int n = 0;
	int ret = 0;
	scanf("%d", &n);
	//TDD-测试驱动
	ret = Fib(n);
	printf("ret=%d\n", ret);
	return 0;
}