hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 15:53:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add links to zh-CN version of Factorial.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2018-12-28 16:35:54 +02:00
parent af77d1adc1
commit 3064a7906b
2 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.zh-CN.md
View File

@ -53,7 +53,7 @@ _Read this in other languages:_
* **数学** * **数学**
* `B` [Bit 操控](src/algorithms/math/bits) - set/get/update/clear 位、乘以/除以二进制位 、变负等 * `B` [Bit 操控](src/algorithms/math/bits) - set/get/update/clear 位、乘以/除以二进制位 、变负等
* `B` [阶乘](src/algorithms/math/factorial) * `B` [阶乘](src/algorithms/math/factorial/README.zh-CN.md)
* `B` [斐波那契数](src/algorithms/math/fibonacci) - `经典` 和 `闭式` 版本 * `B` [斐波那契数](src/algorithms/math/fibonacci) - `经典` 和 `闭式` 版本
* `B` [素数检测](src/algorithms/math/primality-test) (排除法) * `B` [素数检测](src/algorithms/math/primality-test) (排除法)
* `B` [欧几里得算法](src/algorithms/math/euclidean-algorithm) - 计算最大公约数 (GCD) * `B` [欧几里得算法](src/algorithms/math/euclidean-algorithm) - 计算最大公约数 (GCD)

3
src/algorithms/math/factorial/README.md
View File

@ -1,5 +1,8 @@
# Factorial # Factorial
_Read this in other languages:_
[_简体中文_](README.zh-CN.md),
In mathematics, the factorial of a non-negative integer `n`, In mathematics, the factorial of a non-negative integer `n`,
denoted by `n!`, is the product of all positive integers less denoted by `n!`, is the product of all positive integers less
than or equal to `n`. For example: than or equal to `n`. For example: