Question

• Write a program called gcd that accepts two positive integers in the range of [32,256] as parameters and prints the greatest common divisor (GCD) of the two numbers.
• The GCD of two integers a and b is the largest integer that is a factor of both a and b. One efficient way to compute the GCD of two numbers is to use Euclid’s algorithm, which states the following:
• GCD (a, b) _ GCD (b, a % b)
• GCD (a, 0) _Absolute value of a

DON’T USE RECURSIVELY CALL!

Urgent Please

Answer 1

As coding language was not specified in question i have written this code in Python 3

Code using Euclid Euclid’s algorithm without using recursive calls:-

def GCD(m,n):
    if(n==0):
        return abs(m)
    if(m<n):
        (m,n)=(n,m)
    while(m%n !=0):
        (m,n)=(n,m%n)
    return(n)

Sample input/output:-