遞歸求Fibonacci數列

<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);
}