C++ question...Given positive two integers m and n such that m<n, the greatest c

Question

C++ question...Given positive two integers m and n such that m<n, the greatest common divisor of m and n is the same as the greatest common divisor of m and (n-m). Use this fact to write a recursive definition of the function "greatest_common_divisor(...)", which takes two positive integer arguments and returns their greatest common divisor. Test your function in a suitable main program. Hint: Use While conditions until one number becomes 0.
C++ question...Given positive two integers m and n such that m<n, the greatest common divisor of m and n is the same as the greatest common divisor of m and (n-m). Use this fact to write a recursive definition of the function "greatest_common_divisor(...)", which takes two positive integer arguments and returns their greatest common divisor. Test your function in a suitable main program. Hint: Use While conditions until one number becomes 0.
C++ question...Given positive two integers m and n such that m<n, the greatest common divisor of m and n is the same as the greatest common divisor of m and (n-m). Use this fact to write a recursive definition of the function "greatest_common_divisor(...)", which takes two positive integer arguments and returns their greatest common divisor. Test your function in a suitable main program. Hint: Use While conditions until one number becomes 0.

Explanation / Answer

#include using namespace std; int gcd(int a, int b) { if(b == 0) { return a; } else { return gcd(b, a % b); } } int main() { int a,b; cout > a; cout > b; cout

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---