compute the greatest common divisor using euclid's algorithm
npm install gcdCompute the greatest common divisor using
Euclid's algorithm.
`` js`
var gcd = require('gcd');
var n = gcd(121,44);
console.log(n);
*
`
11
` js`
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