We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cdcd526 commit c94b3a5Copy full SHA for c94b3a5
Contents/09.Algorithm-Base/02.Recursive-Algorithm/01.Recursive-Algorithm.md
@@ -4,7 +4,7 @@
4
5
举个简单的例子来了解一下递归算法。比如阶乘的计算方法在数学上的定义为:
6
7
-$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n * fact(n - 1) & \text{n > 0} \end{cases}$
+$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n \times fact(n - 1) & \text{n > 0} \end{cases}$
8
9
根据阶乘计算方法的数学定义,我们可以使用调用函数自身的方式来实现阶乘函数 $fact(n)$ ,其实现代码可以写作:
10
0 commit comments