mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 17:49:40 +08:00
33 lines
1.1 KiB
JavaScript
33 lines
1.1 KiB
JavaScript
/*
|
|
Problem statement and Explanation : https://en.wikipedia.org/wiki/Euclidean_algorithm
|
|
|
|
In this method, we have followed the iterative approach to first
|
|
find a minimum of both numbers and go to the next step.
|
|
*/
|
|
|
|
/**
|
|
* 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 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 = GetEuclidGCD
|