zuhegongshi.c

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

/*=========================================Program Description ==========================*/
/*程序名称 :zuhegongshi                                                                    */
/*程序目的 :设计求组合公式的程序                                                          */
/*written by chen xiao yong .(chen studio)                                 */
/*=======================================================================================*/

/*---------------------------------------------------------*/
/*递归求组合公式*/
/*---------------------------------------------------------*/

int Comb(int N,int M)
{
	if ((N == M) || (M == 0)) return 1;
	else return Comb(N-1,M) + Comb(N-1,M-1);
}

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

	printf("The Combination Number of two Numbers.\n");
	printf("N比M大,Please enter number N:");
	scanf("%d",&NumberN);
	printf("Please enter numger M: ");
	scanf("%d",&NumberM);

	if (NumberN >= NumberM) {
		Result = Comb(NumberN,NumberM);
		printf("Comb(%d,%d) = %d",NumberN,NumberM,Result);
	}
	else printf("Error : N < M!!\n");

}