Greatest common divisor of two numbers (Euclid algorithm)

Greatest common divisor of two numbers p and q (Greatest common divisor,gcd), using properties

If p > Q, p and q are greatest common divisor = q and (p% q) of greatest common divisor.

Proof: See http://blog.csdn.net/niushuai666/article/details/7278027

 Public classeuclid{//recursive inplementation     Public Static intgcdintPintq) {        if(q = 0)returnp; Else{stdout.println (q+ "" + p%q); returnGCD (q, p%q); }    }    //non-recursive Implementation     Public Static intGCD2 (intPintq) {     while(Q! = 0){        inttemp =Q; Q= p%Q; P=temp; }    returnp; }     Public Static voidMain (string[] args) {intp = integer.parseint (args[0]); intQ = Integer.parseint (args[1]); intD =gcd (P, q); intD2 =GCD2 (P,Q); Stdout.println ("GCD (" + p + "," + q + ") =" +d); Stdout.println ("GCD (" + p + "," + q + ") =" +D2); }}

Run results

Greatest common divisor of two numbers (Euclid algorithm)