JavaScript: Compute the greatest common divisor (GCD) of two positive integers

Last update on May 30 2022 10:01:52 (UTC/GMT +8 hours)

JavaScript Conditional Statement and loops: Exercise-11 with Solution

Write a JavaScript program to compute the greatest common divisor (GCD) of two positive integers.

Pictorial Presentation:

JavaScript: Compute the greatest common divisor (GCD) of two positive integers

Sample Solution:-

HTML Code:

<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>compute the greatest common divisor (GCD) of two positive integers</title>
</head>
<body>

</body>
</html>

JavaScript Code:

var a = 2154; //First number
var b = 458;  //Second number 
var gcd;
while (a!=b)
{
	if (a>b)
	{
		a = a -b;
	}
	else
	{
		b = b - a;
	}
}
gcd = a;
console.log(gcd);

Sample Output:

Flowchart:

Live Demo:

See the Pen javascript-conditional-statements-and-loops-exercise-11 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Previous: Write a JavaScript program to construct the following pattern, using a nested for loop.
Next: Write a JavaScript program to sum the multiples of 3 and 5 under 1000.

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