Get Greatest Common Divisor (GCD) using Euclidean Algorithm.
Install
npm i fun-gcd
Usage
// 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-
Notifications
You must be signed in to change notification settings - Fork 0
Find the Greatest Common Divisor using Euclidean Algorithm
zubayerhimel/fun-gcd
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Find the Greatest Common Divisor using Euclidean Algorithm