Please note, this is a STATIC archive of website www.w3resource.com from 19 Jul 2022, cach3.com does not collect or store any user information, there is no "phishing" involved.
w3resource

JavaScript: Find the greatest common divisor of two positive numbers

JavaScript Function: Exercise-2 with Solution

Write a JavaScript program to find the greatest common divisor (gcd) of two positive numbers.

Pictorial Presentation:

JavaScript: Find the greatest common divisor of two positive numbers

Sample Solution:-

HTML Code:

<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>Recursive function to find the GCD of two numbers</title>
</head>
<body>

</body>
</html>

JavaScript Code:

var gcd = function(a, b) {
    if ( ! b) {
        return a;
    }

    return gcd(b, a % b);
};
console.log(gcd(2154, 458));

Output:

2

Flowchart:

Flowchart: Flowchart: JavaScript recursion function- Find the greatest common divisor(gcd) of two positive numbers

Live Demo:

See the Pen javascript-recursion-function-exercise-2 by w3resource (@w3resource) on CodePen.


Improve this sample solution and post your code through Disqus

Previous: Write a JavaScript program to calculate the factorial of a number.
Next: Write a JavaScript program to get the integers in range (x, y).

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



JavaScript: Tips of the Day

How to insert an item into an array at a specific index (JavaScript)?

What you want is the splice function on the native array object.

arr.splice(index, 0, item); will insert item into arr at the specified index (deleting 0 items first, that is, it's just an insert). In this example we will create an array and add an element to it into index 2:

var arr = [];
arr[0] = "Jani";
arr[1] = "Hege";
arr[2] = "Stale";
arr[3] = "Kai Jim";
arr[4] = "Borge";

console.log(arr.join());
arr.splice(2, 0, "Lene");
console.log(arr.join());

Ref: https://bit.ly/2BXbp04