《第6章函数与宏定义.ppt

* */49 间接递归： 显然，递归有可能陷入无限递归状态，最终导致错误发生。因此，设计一个递归问题必须具备两个条件： 1．后一部分与原始问题类似。 2．后一问题是原始问题的简化。 Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */49 【例6-6】 编程，从键盘输入一个正整数n，求n!。 n!的数字表达式为： n!= 定义一个求n!的函数：long fac(int n) long fac(int n) { long result; if (n= = 0 || n= =1) result =1; else result=n*fac(n-1); return(result); } Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */49 完整程序如下： /*exam6_6.c 用递归法求n!*/ #include stdio.h long fac(int n) { long result; if(n==0||n==1) result=1; else result=n*fac(n-1); return result; } main() { int x; long f; Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */49 scanf(%d,x); if(x=0) printf(Your input is wrong!\n); else { f=fac(x); printf(%d!=%ld\n,x,f); } } 程序运行结果: 6? 6!=720 Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */49 【例6-7】 求Fibonacci数列第i项的值。 Fibonacci数列：0, 1, 1, 2, 3, 5, 8, 13, 21,… 其数字表达式为： fibonacci(0)=0 fibonacci(1)=1 fibonacci(n)=fibonacci(n-1)+fibonacci(n-2) (n1) 设计一个函数：long fibonacci (int n)用于计算数列中第n项的值， Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */49 程序如下所示： /*exam6_7.c 求第n项Fibonacci数列的值*/ #include stdio.h long fibonacci(int n); main() { int x=0; long result; do { result=fibonacci(x); printf(fibonacci(%d)=%ld\n,x,result); scanf(%d,x); }while(x!=-1); } Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. C 程序设计基础教程 第六章函数与宏定义 * */49 第六章 函数与宏定义 §6.1 函数概念 §6.2 变量作用域和存储类型 §6.3 内部函数与外部函数 §6.4 递归函数设计和调用 §6.6 综合范例 Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. * */