今天开始看看算法
求最大公约数算法Euclidean algorithm
![](https://img-my.csdn.net/uploads/201301/10/1357782261_7041.jpg)
![](https://img-my.csdn.net/uploads/201301/10/1357784668_1778.jpg)
public class Euclidean_algorithm {
public static void main(String[] args) {
System.out.println(euclidean(6, 5));
}
public static int euclidean(int n, int m) {
if (m % n == 0) {
return n;
} else {
return euclidean(m%n, n);//无需判断n,m的大小;即使n>m会自动交换
}
}
}