fibonaccinumbers.c

recursive:数据结构(黄国瑜 叶乃菁 编著)中的递归例子

/*=========================================Program Description ==========================*/
/*程序名称 :FibonacciNumbers                                                                    */
/*程序目的 :设计求费氏级数的程序                                          */
/*written by chen xiao yong .(chen studio)                                 */
/*=======================================================================================*/

/*---------------------------------------------------------*/
/*递归求费氏级数*/
/*---------------------------------------------------------*/

int Fib(int N)
{
	if (N <= 1) return N;
	else return Fib(N-1) + Fib(N-2);
}

/*-----------------------------------------------------------*/
/*主程序*/
/*-----------------------------------------------------------*/
# include <stdio.h>
void main()
{
	int NumberA;
	int Result;

	printf("The Fibonacci Numbers  \n");
	printf("Please enter a number  :");
	scanf("%d",&NumberA);

	Result = Fib(NumberA);
	printf("Fibonacci Numbers of %d = %d\n",NumberA,Result);

}