Algorithm // Finding Greatest Common Divisor in Typescript using Euclidean algorithm

finding-gcd.ts

function findGDC(num1: number, num2: number): number {
  function calcMod(v1: number, v2: number): number {
    return v1 % v2;
  }

  let a = num1;
  let b = num2;
  while (b > 0) {
    const mod = calcMod(a, b);
    if (mod === 0) break;

    a = b;
    b = mod;
  }

  return b;
}

console.log("Greatest Common Divisor =", findGDC(692, 908));