最大公约数算法是算法教材的第一个例子
java版本如下:
package art.program;
//Algorithm of the greatest common divisor
public class GCD {
public static void main(String[] args) {
int gcd = GCD.gcd(21, 6);
int gcd2 = GCD.reGCD(21, 6);
System.out.println(gcd);
System.out.println(gcd2);
}
public static int gcd(int m, int n) {
int r = m % n;
while (r != 0) {
m = n;
n = r;
r = m % n;
}
return n;
}
public static int reGCD(int m, int n) {
if (m % n == 0) {
return n;
} else {
return reGCD(n, m % n);
}
}
}