How to resolve the algorithm Greatest common divisor step by step in the SNOBOL4 programming language

Published on 12 May 2024 09:40 PM

#Snobol4

How to resolve the algorithm Greatest common divisor step by step in the SNOBOL4 programming language

Table of Contents

Problem Statement
Step by Step Solution
Sourcecode

Problem Statement

Find the greatest common divisor (GCD) of two integers.

Greatest common divisor is also known as greatest common factor (gcf) and greatest common measure.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Greatest common divisor step by step in the SNOBOL4 programming language

Source code in the snobol4 programming language

	define('gcd(i,j)')	:(gcd_end)
gcd	?eq(i,0)	:s(freturn)
	?eq(j,0)	:s(freturn)

loop	gcd = remdr(i,j)
	gcd = ?eq(gcd,0) j	:s(return)
	i = j
	j = gcd			:(loop)
gcd_end

	output = gcd(1071,1029)
end

You may also check:How to resolve the algorithm Twin primes step by step in the Nim programming language
You may also check:How to resolve the algorithm Calculating the value of e step by step in the Craft Basic programming language
You may also check:How to resolve the algorithm Execute a system command step by step in the Modula-3 programming language
You may also check:How to resolve the algorithm Loops/Increment loop index within loop body step by step in the Julia programming language
You may also check:How to resolve the algorithm Pseudo-random numbers/Middle-square method step by step in the 11l programming language