Question: IN C++ 3) Please write a program uses recursive and iterative functions to find the GCD of two numbers. In mathematics, the greatest common divisor
IN C++ 
3) Please write a program uses recursive and iterative functions to find the GCD of two numbers. In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4. Recursive if b-0 otherwise. Definition: For a,b 20, gcd(a,b) = | gcd(b, a mod b)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
