algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

change the GetGCD method to GetEuclidGCD method

Browse Source
This commit is contained in:
Suryapratap Singh
2021-08-31 13:53:49 +05:30
parent 92b8b46f36
commit 09ce0c76a6
1 changed files with 7 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
Maths/GetEuclidGCD.js
View File

@ -6,24 +6,27 @@
*/
/**
* GetGCD return the gcd of two numbers.
* GetEuclidGCD return the gcd of two numbers using Euclidean algorithm.
* @param {Number} arg1 first argument for gcd
* @param {Number} arg2 second argument for gcd
* @returns return a `gcd` value of both number.
*/
const getGcd = (arg1, arg2) => {
const GetEuclidGCD = (arg1, arg2) => {
// firstly, check that input is a number or not.
if (typeof arg1 !== 'number' || typeof arg2 !== 'number') {
return new TypeError('Argument is not a number.')
}
// check that the input number is not a negative value.
if (arg1 < 1 || arg2 < 1) {
return new TypeError('Argument is a negative number.')
}
// Find a minimum of both numbers.
let less = arg1 > arg2 ? arg2 : arg1
// Iterate the number and find the gcd of the number using the above explanation.
for (less; less >= 2; less--) {
if ((arg1 % less === 0) && (arg2 % less === 0)) return (less)
}
return (less)
}
module.exports = getGcd
module.exports = GetEuclidGCD