Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
npm install fun-gcdGet Greatest Common Divisor (GCD) using Euclidean Algorithm.
Install
``
`
npm i fun-gcd
`
Usage
js
``
// es5
const eq = require("fun-gcd");
// es6
import eq from "fun-gcd";
console.log(eq.gcdOfTwo(2, 3));
// => 1
console.log(eq.gcdOfTwo(7, 77));
// => 7