Euclidean algorithm for finding GCD
Bibin Jaimon
Posted on August 31, 2024
function findGCD(num1, num2) {
if (num1 > 0 && num2 > 0) {
const val = num1 < num2 ? {
min: num1,
max: num2
} : {
min: num2,
max: num1
}
return findGCD(val.max - val.min, val.min)
}
return num1 != 0 ? num1 : num2
}
💖 💪 🙅 🚩
Bibin Jaimon
Posted on August 31, 2024
Join Our Newsletter. No Spam, Only the good stuff.
Sign up to receive the latest update from our blog.
Related
githubcopilot AI Innovations at Microsoft Ignite 2024 What You Need to Know (Part 2)
November 29, 2024