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:
Angelos Chalaris
2017-12-29 13:11:38 +02:00
committed by GitHub
parent ae8749df27
commit d74df3dc8f
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
snippets/gcd.md
View File

@ -2,15 +2,15 @@
Calculates the greatest common divisor between two or more numbers/arrays. Calculates the greatest common divisor between two or more numbers/arrays.
The helperGcd function uses recursion. The `helperGcd `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`.
```js ```js
const gcm = (...arr) => { const gcd = (...arr) => {
let data = [].concat(...arr) let data = [].concat(...arr);
const helperGcd = (x, y) => (!y ? x : gcd(y, x % y)); const helperGcd = (x, y) => (!y ? x : gcd(y, x % y));
return data.reduce((a, b) => helperGcd(a, b)) return data.reduce((a, b) => helperGcd(a, b));
} }
``` ```