UNPKG

gcd-euclidean

Version:

GCD calculation for any two given integer.

19 lines (18 loc) 362 B
{ "name": "gcd-euclidean", "version": "0.0.2", "description": "GCD calculation for any two given integer.", "main": "index.js", "scripts": { "test": "npm run test" }, "keywords": [ "GCD" ], "author": "Md Layeeque", "repository": { "type": "git", "url": "https://github.com/layeeque-md/gcd-euclidean" }, "license": "MIT" }