c02p062.txt

来自「Data Abstraction & Problem Solving with 」· 文本 代码 · 共 11 行

int fact(int n)
// Precondition: n must be greater than or equal to 0.
// Postcondition: Returns the factorial of n.
{
   if (n == 0)
      return 1;
   else  // Invariant: n > 0, so n-1 >= 0.
         // Thus, fact(n-1) returns (n-1)!
      return n * fact(n-1);  // n * (n-1)! is n!
}  // end fact