C++ 学习笔记_0015_递归（读懂C++递归程序）

阶乘函数递归

#include<iostream>using namespace std;long fact(int);int main(){    int n;    long y;    cin >> n;    y = fact(n);    cout << endl << n << "!=" << y << endl;    return 0;}long fact(int n){    long f;    if (n == 1) f = 1;    else    {        cout << "***f = " << f << "  n = " << n << endl;        f = n * fact(n-1);        cout << "f = " << f << "  n = " << n << endl;    }    return f;}