mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 17:49:40 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
21 lines
575 B
JavaScript
21 lines
575 B
JavaScript
/**
|
|
* 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) {
|
|
if (typeof a !== 'number' || typeof b !== 'number') {
|
|
throw new TypeError('Arguments must be numbers')
|
|
}
|
|
if (a === 0 && b === 0) return undefined // infinitely many numbers divide 0
|
|
a = Math.abs(a)
|
|
b = Math.abs(b)
|
|
while (b !== 0) {
|
|
const rem = a % b
|
|
a = b
|
|
b = rem
|
|
}
|
|
return a
|
|
}
|