A method for finding the greatest common divisor of two numbers

For two integers x, y, greatest common divisor (language: c,c++)

Principle: The division of the greatest common divisor: is constantly using the divisor to remove the remainder, until the remainder is 0, the resulting divisor is the two number of greatest common divisor

1. Recursive method:

1. int gcd (int x,int y)
2. {
3. int result;
4. if (y==0)
5. Result=x;
6. Else
7. RESULT=GCD (y,x%y);
8. return result;
9. }

2. Non-recursive method (Euclidean method)

2. int gcd (int x,int y)
4. {//Greatest common divisor: the remainder is continuously removed with the divisor until the remainder is 0
6. int tem ;
8. While (x%y!=0)
10. {
12. tem=x%y;
14. X=y;
16. Y=tem;
18. }
20. return y;
22. }

A method for finding the greatest common divisor of two numbers