gcd javascript Code Snippet in 2025
mathalgorithmrecursionintermediate
Last Updated: 28 October 2025
Calculates the greatest common divisor between two or more numbers/arrays.
- The inner
_gcdfunction uses recursion. - Base case is when
yequals0. In this case, returnx. - Otherwise, return the GCD of
yand the remainder of the divisionx/y.
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]); // 4javascript snippet similar to gcd For You in October 2025
Subscribe to our Newsletter
Subscribe to get resources directly to your inbox. You won't receive any spam! ✌️