Java: get greatest common divisor

Question

I have seen that such a function exists for BigInteger, i.e. BigInteger#gcd. Are there other functions in Java which also work for other types (int, long or Integer)? It seems this would make sense as java.lang.Math.gcd (with all kinds of overloads) but it is not there. Is it somewhere else?

---

(Don't confuse this question with "how do I implement this myself", please!)

Answer 1

As far as I know, there isn't any built-in method for primitives. But something as simple as this should do the trick:

public int gcd(int a, int b) {    if (b==0) return a;    return gcd(b,a%b); } 

You can also one-line it if you're into that sort of thing:

public int gcd(int a, int b) { return b==0 ? a : gcd(b, a%b); } 

It should be noted that there is absolutely no difference between the two as they compile to the same byte code.