Highest Common Factor - Greatest Common Divisor in JavaScript

Finding H.C.F. - G.C.D. in JavaScript

A common method for finding H.C.F. - G.C.D. is repeated factorization using only common factors.

If we have the set of numbers 30, 48 and 54 for example, their H.C.F. or G.C.D. is found thus:

Hence, H.C.F. of 30, 48 and 54 = 2 X 3 = 6

Simulating H.C.F. (G.C.D.) in JavaScript code

We shall follow the steps below in writing our code.

Step 1:

Do a numerical sort on the set so its first member is the smallest in the set.

Step 2:

Starting with 2, iteratively check through the set of numbers for a common factor.

Step 3:

For each common factor, divide every member of the number set by the common factor.

Step 4:

Repeat from step 2 recursively until there are no more common factors.

Create 2 new files; On Notepad++: File, New.
Call them HCF.html and HCF.js.
Type out the adjoining JavaScript code for finding Highest Common Factor (Greatest Common Divisor).

JavaScript code for HCF.html

<!DOCTYPE html>

<html lang="en">
    <head>
        <meta charset="utf-8" />
        <title>Find H.C.F.</title>
        <script src="HCF.js"></script>
    </head>
    <body>
        <h4>Highest Common Factors of a Group of Numbers.</h4>
        <div id="myHCF"></div>

        <script>
            /*
             * 'group_of_numbers' holds the numbers whose HCF we are trying to find.
             * Add as many of these numbers as you wish by extending the array.
             */
            var group_of_numbers = [];
            group_of_numbers[0] = 14;
            group_of_numbers[1] = 49;
            group_of_numbers[2] = 21;
            group_of_numbers[3] = 42;

            var result = getHCF(group_of_numbers); // call to our function

            document.getElementById("myHCF").innerHTML =
                    "The H.C.F. of " + group_of_numbers.join(", ") + " is: " + result;
        </script>
    </body>
</html>

HCF.js

I have a better version / See other versions.