GCD of 2 numbers in C++
What is GCD? The greatest common divisor is the maximum number which divides two numbers. For e.g. GCD of 24 and 32: Divisors of 24: 1,2,3,4,6,8,12. Divisors of 32: 1,2,4,8,16. 8 is maximum number which divides both of them, Hence GCD of 24 and 32 is 8. Following is the program to find GCD … Read more