Compute the greatest common divisor between two numbers

Apply Euclid’s algorithm.

JavaScript Version 1.0.0 · MIT · .md

function gcd({ a, b }) { return b === 0 ? Math.abs(a) : gcd({ a: b, b: a % b }); }

Input & expected output

{
  "a": 48,
  "b": 18
}

6

The edge case

{
  "a": -4,
  "b": 6
}

2

Know the limits

• Returns a non-negative result; the original could return a negative divisor.
• Integers only.

The function above is the implementation used by the lab. The lab validates JSON types and caps size before execution; include equivalent validation when accepting untrusted input in your application.

Keep exploring

• Clamp a number to a range — Keep a number inside an inclusive minimum and maximum.
• Round to a number of digits — Apply decimal scaling and JavaScript rounding for display-oriented values.
• Add an ordinal suffix to a number — Append st, nd, rd or th to a positive integer.