Data structure--seeking greatest common divisor (Euclidean algorithm)

Package Com.itany.oulijide;public class test{public        static void Main (string[] args)    {        int result=gcd ( 50,15);        SYSTEM.OUT.PRINTLN (result);    }    Default M>n, if M<n, then the first iteration will exchange the two public    static int gcd (int m,int N)    {while        (n!=0)        {            int rem=m%n;            M=n;            N=rem;        }        return m;    }    }

Run time is logarithmic!

Its calculation principle relies on the following theorem: Theorem: gcd (A, a, b) = gcd (b,a MoD) (A>b and a mod B is not 0) proves that: A can be expressed as A = kb + R, then r = a mod b assumes that D is a number of conventions of a A, then d|a,d|b, and R = A-KB, so d|r D is therefore also (B,a mod b) The number of conventions so (b) and (B,a MoD b) are the same, and their greatest common divisor are necessarily equal,

Data structure--seeking greatest common divisor (Euclidean algorithm)