Question

Can someone help me write a small clean "helper" function which accepts two arguements, finds the greatest common divisor, and returns it? DO NOT use recursion. This is to be written in C++. I would be greatful if you wrote a small driver main() to test it as well.

Thanks in advance.

Answer 1

#include <stdio.h>

int gcd(int n1, int n2);
int helper(int n1, int n2);

int main()
{
int n1, n2;
printf("Enter two positive integers: ");
scanf("%d %d", &n1, &n2);

printf("GCD of %d and %d is %d.", n1, n2, gcd(n1,n2));
return 0;
}

int gcd(int n1, int n2)
{
if (n2 != 0)
return helper(n1,n2);
else
return n1;
}
int helper(int n1, int n2)
{
return gcd(n2, n1%n2);
}