Print HCF of Two Integers in JavaScript

Computations and programming when combined make a very deadly combination. As the ability to solve complex mathematical questions in itself is a great deal. But when one has to do the same thing by writing up a code, things get somewhat more complicated. Not to mention the language your coding in also determines whether it’s going to be easy to difficult. So today we’re going to write a program to print HCF of Two Integers in JavaScript.

 

What’s The Approach? 

 

• Let us consider a and b to be the two Integers to find HCF of.

 

• Firstly we’ll find the gcd of these two numbers, i.e, by using a condition where if a becomes zero we’ll return b and vice versa.

 

• However, if that’s not the case then we’ll simply recursively return b % aif b is greater and vice versa if a is greater no. That way we’ll get, gcd as output.

 

Also Read:  How To Print Hello World in JavaScript

 

JavaScript Program To Print HCF of Two Integers

 

Input:

 

a = 98, b = 56

 

Output:

 

HCF of 98 and 56 is 14

 

<script>

// Javascript program to Find GCD/HCF of two numbers

// Recursive function to return gcd of a and b
function gcd(a, b)
{
    // Everything divides 0
    if (a == 0)
    return b;
    if (b == 0)
    return a;

    // base case
    if (a == b)
        return a;

    // a is greater
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
}

// Driver program

    let a = 98, b = 56;
    document.write("GCD of "+ a + " and " + b + " is " + gcd(a, b));

</script>