andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update gcd.md

Browse Source
This commit is contained in:
atomiks
2018-01-05 00:40:42 +11:00
committed by GitHub
parent e67005f052
commit 38967ad9d0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
snippets/gcd.md
View File

@ -2,7 +2,7 @@
Calculates the greatest common divisor between two or more numbers/arrays. 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`. 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`. Otherwise, return the GCD of `y` and the remainder of the division `x/y`.