Calculates the greatest common divisor between two or more numbers/arrays.

const gcd = (...arr) => {
 const _gcd = (x, y) => (!y ? x : gcd(y, x % y));
 return [...arr].reduce((a, b) => _gcd(a, b));
};

gcd(8, 36); // 4
gcd(...[12, 8, 32]); // 4

Calculates the greatest common divisor between two or more numbers/arrays.
<ul>
<li>The inner <code class="notranslate">_gcd</code> function uses recursion.</li>
<li>Base case is when <code class="notranslate">y</code> equals <code class="notranslate">0</code>. In this case, return <code class="notranslate">x</code>.</li>
<li>Otherwise, return the GCD of <code class="notranslate">y</code> and the remainder of the division <code class="notranslate">x / y</code>.</li>
</ul>

Greatest common divisor

Recommended snippets

Least common multiple

Euclidean distance

Vector distance