mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
bd34e9fa61
* feat: remove duplicated `gcd`-like functions * Updated Documentation in README.md --------- Co-authored-by: vil02 <vil02@users.noreply.github.com>
40 lines
918 B
JavaScript
40 lines
918 B
JavaScript
function CheckInput(a, b) {
|
|
if (typeof a !== 'number' || typeof b !== 'number') {
|
|
throw new TypeError('Arguments must be numbers')
|
|
}
|
|
}
|
|
|
|
/**
|
|
* GetEuclidGCD Euclidean algorithm to determine the GCD of two numbers
|
|
* @param {Number} a integer (may be negative)
|
|
* @param {Number} b integer (may be negative)
|
|
* @returns {Number} Greatest Common Divisor gcd(a, b)
|
|
*/
|
|
export function GetEuclidGCD(a, b) {
|
|
CheckInput(a, b)
|
|
a = Math.abs(a)
|
|
b = Math.abs(b)
|
|
while (b !== 0) {
|
|
const rem = a % b
|
|
a = b
|
|
b = rem
|
|
}
|
|
return a
|
|
}
|
|
|
|
/**
|
|
* Recursive version of GetEuclidGCD
|
|
* @param {Number} a integer (may be negative)
|
|
* @param {Number} b integer (may be negative)
|
|
* @returns {Number} Greatest Common Divisor gcd(a, b)
|
|
*/
|
|
export function GetEuclidGCDRecursive(a, b) {
|
|
CheckInput(a, b)
|
|
a = Math.abs(a)
|
|
b = Math.abs(b)
|
|
if (b == 0) {
|
|
return a
|
|
}
|
|
return GetEuclidGCDRecursive(b, a % b)
|
|
}
|