HTML Code

<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="utf-8">
  <title>GCD — recursive</title>
</head>
<body>
  <h1>Greatest common divisor (recursive)</h1>
  <p>Edit <code>number1</code> and <code>number2</code>, then <strong>Run</strong>.</p>
  <pre id="out"></pre>
  <script>
    (function () {
      function gcdRecursive(a, b) {
        a = Math.abs(a);
        b = Math.abs(b);
        if (b === 0) {
          return a;
        }
        return gcdRecursive(b, a % b);
      }
      var number1 = 48;
      var number2 = 18;
      document.getElementById("out").textContent =
        "GCD of " +
        number1 +
        " and " +
        number2 +
        " is: " +
        gcdRecursive(number1, number2);
    })();
  </script>
</body>
</html>

Lines: 0 | Characters: 0

Live Preview Auto-refresh on Run

JavaScript GCD — Recursive Euclidean (Try It)