Greatest Common Divisor (GCD) in C++
I need the following problem in C++ with a recursive function and a driver programe to test the function ?
* A recursive program to calculate the Greatest
Common Divisor of two integers using the Euclidean Method.
The algorithm in non-recursive form is as follows:
EuclidGCD(a,b) {
while (b not 0) {
swap(a,b)
b = b mod a;
}
return a;
}
example:
gcd(356,96) = gcd(96,68) = gcd(68,28) = gcd(28,12) = gcd(12,4) = gcd(4,0) = 4
*/
#include
#define DEBUG 1
int gcd(int a, int b){
if (b==0) return a;
#ifdef DEBUG
printf("gcd(%d, %d)= ", b,a%b);
#endif
gcd(b, a%b);
}
int main(){
int a=356, b=96;
printf(" Please Enter two integers for their GCD :");
scanf("%d%d",&a,&b);
printf("%d",gcd(a,b));
return 0;
}
Solution of the problem is given in C++ with a recursive function and a driver program to test the function
- Plain text response
- Attached file(s):
- 138039-GCD.CPP.cpp
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Recursive function to calculate the GCD of two integers - Write a recursive function that calculates the greatest common divisor of two integers using the Euclidean algorithm. Write a driver program to test your function.
- Determining the greatest common divisor using the Euclidean Algorithm. - How do I use the Euclidean Algorithm for determining the greatest common divisor of two integers?
- Write a program to test function then write and test an equivalent iterative function for GCD - write program to test function then write and test an equivalent iterative function int gcd (int a, int b) { int r; if ((r=a%b)==0) return b else return gcd(b,r); }
- Recursion C++ - Write a recursive algorithm to multiply two positive integers m and n using repeated addition. Specify the base case and the recursive case.
- Algorithms - Trace the action of the algorithm NaiveGCD for the following input pairs. a. (24,108) b. (23,108) c. (89,144) d. (1953,1937) Exercise 1.8: Repeat Exercise 1.7 for the algorithm Eu ...
