mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-06 09:28:26 +08:00
re-formate GetGCD with standard.js
This commit is contained in:
@ -12,15 +12,15 @@
|
|||||||
* @returns return a `gcd` value of both number.
|
* @returns return a `gcd` value of both number.
|
||||||
*/
|
*/
|
||||||
const getGcd = (arg1, arg2) => {
|
const getGcd = (arg1, arg2) => {
|
||||||
// Find a minimum of both numbers.
|
// 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)
|
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 = getGcd
|
module.exports = getGcd
|
||||||
|
Reference in New Issue
Block a user