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>document.getElementById("out").textContent="GCD of 48 and 18 is: "+function t(n,e){return 0===e?n:t(e,n%e)}(48,18)</script>
</body>
</html>

Lines: 0 | Characters: 0

Live Preview Auto-refresh on Run

JavaScript GCD — Recursive Euclidean (Try It)