The algorithm summarizes a line of code to find the greatest common divisor of two numbers

Given two integers not equal to 0 m and N, the greatest common divisor of M and N are obtained.

Euclidean method

Idea: If Q and R are the quotient and remainder of M divided by N, that is, M=nq+r, then the greatest common divisor of M and n equals the number of large conventions of N and R! (recursive)

 Public class Test9 {    publicstaticint gcd (intint  n) {         return n==0? M:GCD (n, m%n);    }          Public Static void Main (string[] args) {                int  x = gcd (3);         SYSTEM.OUT.PRINTLN (x);            }    }

The algorithm summarizes a line of code to find the greatest common divisor of two numbers