antonvorobyev
9/27/2015 - 9:18 AM

Recursive Euclidian algorithm for GCD

Recursive Euclidian algorithm for GCD


package co.vorobyev.snippets;

public class EuclidianGcd {

    public static int gcd(int p, int q) {
        if (q == 0) return p;
        int r = p % q;
        return gcd(q, r);
    }

}