Seeking greatest common divisor by the method of dividing

The Euclidean division of the greatest common divisor is one of the best algorithms for solving the two numbers of the two.

Algorithm principle: If the remainder of a divided by B is r, then there is (A, b) = (b, R) ((A, a) ((a) greatest common divisor of A and B)

Example: The greatest common divisor solution process for 169 and 48

169 = 3 + --(169, 48) = (48, 25)

* 1 + --(48, 25) = (25, 13)

25 = 13 * 1 + 12

13 = 12 * 1 + 1

1 * + 0 --(12, 1) = 1

So greatest common divisor is 1

The following is a C + + implementation of the algorithm, using the recursive algorithm

#include <iostream> #include <conio.h>using namespace std;int gcd (int a, int b) {return b = = 0? a:gcd (b, a% b);} int main () {cout << gcd (169) << Endl;_getch (); return 0;}

Seeking greatest common divisor by the method of dividing