Vamshi Bachaneboina c00c689255 Update euclideanAlgorithm.js (#207)
Method 2 is easy to evaluate or understand without using recursion stack!
2018-09-18 08:04:56 +03:00

26 lines
570 B
JavaScript

/**
* @param {number} originalA
* @param {number} originalB
* @return {number}
*/
/*Method 1: A bit Complex to understand*/
export default function euclideanAlgorithm(originalA, originalB) {
const a = Math.abs(originalA);
const b = Math.abs(originalB);
return (b === 0) ? a : euclideanAlgorithm(b, a % b);
}
/*Method 2: Easy to evaluate*/
export default function euclideanAlgorithm2(originalA, originalB) {
const a = Math.abs(originalA);
const b = Math.abs(originalB);
while(a != b){
[a,b] = a>b : [a-b, b] : [a, b-a]
}
return a || b;
}