Update gcd.md

This commit is contained in:
atomiks
2018-01-05 00:40:42 +11:00
committed by GitHub
parent e67005f052
commit 38967ad9d0

View File

@ -2,7 +2,7 @@
Calculates the greatest common divisor between two or more numbers/arrays.
The inner `_gcd `function uses recursion.
The inner `_gcd` function uses recursion.
Base case is when `y` equals `0`. In this case, return `x`.
Otherwise, return the GCD of `y` and the remainder of the division `x/y`.