递归求Fibonacci数列

最新推荐文章于 2024-05-12 09:33:08 发布

wuhui2356

最新推荐文章于 2024-05-12 09:33:08 发布

阅读量2.1k

点赞数

分类专栏： C/C++ 文章标签：递归 Fibonacc c语言编程 c

本文链接：https://blog.csdn.net/wuhui2356/article/details/45751371

版权

C/C++ 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

<pre name="code" class="plain">#include <stdio.h>

int f(int x);
void print(int y);

int main()
{
	
	int i, j;

	printf("Please input a number :\n");
	scanf("%d", &i);

	j = f(i);
	print(j);
	return 0;
}
void print(int y)
{
	printf("Result = %d\n", y);
}

int f(int x)
{
	int m, n, sum = 1;
	for( m = 1; m <= x; m++)
	{
		if( m == 1 || m == 2)
			sum = 1;
		else
			sum = f(m -1) + f( m - 2);
	}
	return (sum);
}