hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-12-27 15:41:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update euclideanAlgorithm.js (#207)

Browse Source 
Method 2 is easy to evaluate or understand without using recursion stack!
This commit is contained in:
Vamshi Bachaneboina 2018-09-18 10:34:56 +05:30 committed by Oleksii Trekhleb
parent c4458e9d42
commit c00c689255
1 changed files with 14 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/algorithms/math/euclidean-algorithm/euclideanAlgorithm.js
View File

@ -3,9 +3,23 @@
* @param {number} originalB * @param {number} originalB
* @return {number} * @return {number}
*/ */
/*Method 1: A bit Complex to understand*/
export default function euclideanAlgorithm(originalA, originalB) { export default function euclideanAlgorithm(originalA, originalB) {
const a = Math.abs(originalA); const a = Math.abs(originalA);
const b = Math.abs(originalB); const b = Math.abs(originalB);
return (b === 0) ? a : euclideanAlgorithm(b, a % b); 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;
}