greatcommondivisor.c

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

/*=========================================Program Description ==========================*/
/*程序名称 :GreatCommonDivisor.c                                                  */
/*程序目的 :运用递归设计一个求两数最大公因子的程序                                  */
/*written by chen xiao yong .(chen studio)                                 */
/*=======================================================================================*/

/*---------------------------------------------------------*/
/*递归求最大公因子                                         */
/*---------------------------------------------------------*/

int GCD(int M,int N)
{
	if (N == 0) return M;
	else return GCD(N,M%N);
}

/*-----------------------------------------------------------*/
/*主程序*/
/*-----------------------------------------------------------*/
# include <stdio.h>
void main()
{
	int NumberA;                 /*运算数值变量*/
	int NumberB;                 /*运算数值变量*/
	int Result;                  /*运算结果变量*/

	printf("The Great Common Divisor of NumberA,NumberB \n");
	printf("Please enter Number A:  ");
	scanf("%d",&NumberA);
	printf("Please enter Number B:  ");
	scanf("%d",&NumberB);

	Result = GCD(NumberA,NumberB);
	printf("GCD(%d,%d) = %d",NumberA,NumberB,Result);

}