西安交大c++5.pptVIP

N!递归的调用过程 * fac(1) //n=1 { if (1==0) factorial=1; else factorial=1*f(1-1); return factorial; } fac(0) //n=0 { if (0==0) factorial=1; else factorial=n*f(n-1); return factorial; } 1 1 N!递归的调用过程 int main() { int n; int factorial; cinn; factorial=f(n); coutfactorialendl; return 1; } #设输入n=3 * f(3) //n=3 { if (3==0) factorial=1; else factorial=3*f(3-1); return factorial; } f(2) //n=2 { if (2==0) factorial=1; else factorial=2*f(2-1); return factorial; }