The greatest common divisor (GCD) of two positive integers is the largest integer that divides both numbers without leaving a remainder. One way to compute the GCD of two numbers is to use the Euclidean algorithm, which is based on the property that the GCD of two numbers also divides their difference. Here is a JavaScript function that uses the Euclidean algorithm to compute the GCD of two positive integers:

function gcd(a, b) {
  if (b == 0) {
    return a;
  return gcd(b, a % b);

You can use this function to compute the GCD of two numbers like this:

console.log(gcd(60, 48)); // Output: 12

This function takes two parameters, ‘a’ and ‘b’, and uses a recursive approach to compute the GCD. The function checks if ‘b’ is equal to zero, if true it returns ‘a’ as the GCD, else it returns the GCD of ‘b’ and the remainder of ‘a’ divided by ‘b’ . It uses the modulus operator (%) to get the remainder. The function calls itself with the values of ‘b’ and ‘a % b’ as arguments until the remainder is zero, at which point the GCD is returned.

Also Read:

Categorized in: