Java programs for "Algorithms and data Structures" greatest common divisor and least common multiple

GCD Greatest Common divisor

Method: Euclid Algorithm (Euclidean method),

"Thought" recursion

Ideas

Code

1  Public classMain {2      Public Static intgcdintPintq) {3         if(q = 0) {4             returnp;5         }6         intr = p%Q;7         returngcd (q, R);8     }9}

LCM Least common multiple

The pursuit of convenient formula method to solve.

Ideas

Code

1  Public classMain {2      Public Static intgcdintPintq) {3         if(q = 0) {4             returnp;5         }6         intr = p%Q;7         returngcd (q, R);8     }9      Public Static intLcmintAintb) {Ten         return(A * b)/gcd (A, b); One     } A}

Java programs for "Algorithms and data Structures" greatest common divisor and least common multiple