This is a `playground`

to test code. It runs a full `Node.js`

environment and already has all of `npm`

’s 400,000 packages pre-installed, including `gcd`

with all `npm`

packages installed. **Try it out**:

var gcd = require("gcd")

- all documents on RunKit are public
`require()`

any package directly from npm- use arrow functions, classes, template strings, and most of ES6
`await`

any promise instead of using callbacks (example)- create your own embedded
**node.js**snippets

This service is provided by RunKit and is not affiliated with npm, Inc or the package authors.

Compute the greatest common divisor using Euclid's algorithm.

```
var gcd = require('gcd');
var n = gcd(121,44);
console.log(n);
```

```
11
```

```
var gcd = require('gcd')
```

Return the greatest common divisor of the integers `a`

and `b`

using Euclid's
algorithm.

With npm do:

```
npm install gcd
```

MIT

- package on npmhttps://npmjs.com/package/gcd
- homepagehttps://github.com/substack/node-gcd
- licenseMIT

RunKit is a free, in-browser JavaScript dev environment for prototyping **Node.js** code, with every **npm** package installed. Sign up to share your code.

Sign Up for Free