Function GetEuclidGCD

Maths/GetEuclidGCD.js:13–23

(a, b)

 * @returns {Number} Greatest Common Divisor gcd(a, b)
 */
export function GetEuclidGCD(a, b) {
  CheckInput(a, b)
  a = Math.abs(a)
  b = Math.abs(b)
  while (b !== 0) {
    const rem = a % b
    a = b
    b = rem
  }
  return a
}

/**
 * Recursive version of GetEuclidGCD