Function gcd

Maths/ShorsAlgorithm.js:90–96

* @function gcd * @description Euclid's GCD algorithm. * @param {BigInt} A * @param {BigInt} B * @returns Greatest Common Divisor between A and B.

(A, B)

 * @returns Greatest Common Divisor between A and B.
 */
function gcd(A, B) {
  while (B !== 0n) {
    ;[A, B] = [B, A % B]
  }

  return Number(A)
}

export { ShorsAlgorithm }