第8章 函数案例.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * double area(double x1, double y1) { return x1 * y1 / 2; } double length(double x2, double y2) { return sqrt(x2 * x2 + y2 * y2); } double cal(double x3, double y3, double(*p)(double m, double n)) { return (*p)(x3, y3); } 8.8 递归的函数调用 递归的函数调用(recursive function call)是指函数直接或间接调用函数本身的函数调用方式 在函数A的函数体中调用函数A，称为直接递归 在函数A的函数体中调用函数B，在函数B的函数体中又调用函数A，称为间接递归 计算n的阶乘可以采用递归的方法： n! = n×(n-1)! (n 1) // 递推公式 n! = 1 (n = 1) // 终结条件 【例8.20】 采用递归的函数调用求n的阶乘 #include stdio.h double factorial(int n); int main(void) { int m; double s; printf(Input a positive integer: ); scanf(%d, m); s = factorial(m); printf(%d! = %.0f\n, m, s); return 0; } 汉诺塔(Tower of Hanoi)问题 A B C #include stdio.h void hanoi(int n, char first, char second, char third); int main(void) { int m; printf(Input a positive integer: ); scanf(%d, m); hanoi(m, A, B, C); return 0; } void hanoi(int n, char first, char second, char third) { if (n 1) { hanoi(n - 1, first, third, second); printf(Move disk %d from %c to %c.\n, n, first, third); hanoi(n - 1, second, first, third); } else printf(Move disk %d from %c to %c.\n, n, first, third); } * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * #include stdio.h int avg(int row, int r[ ][3]); int main(void) { int a[2][3] = {{1, 3, 5}, {2, 4, 6}}; int b[3][3] = {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}}; printf(avg_a = %d\n, avg(2, a)); printf(avg_b = %d\n, avg(3, b)); return 0; } int avg(int row, int r[ ][3]) { int i, j, sum = 0, n = 0; for (i = 0; i row; i++) for (j = 0; j 3; j++) { sum += r[i][j]; n++; } return sum / n; } 8.5 实参向形参的单向传递 int x = 5, y; y