@@ -0,0 +1,388 @@
+package arithmetic.factorial;%0A%0Apublic class GCD %7B%0A    /**%0A     * @see %3Ca href=%22https://codelab.interviewbit.com/problems/gcd/%22%3Ecode lab%3C/a%3E%0A     * m : 6%0A     * n : 9%0A     * %3Cp%3E%0A     * GCD(m, n) : 3%0A     */%0A    public static int gcd(int A, int B) %7B%0A        if (A == 0) %7B%0A            return B;%0A        %7D%0A        int nextA = B%25A;%0A        int nextB = A;%0A        return gcd(B %25 A, A);%0A    %7D%0A%7D%0A

Greatest integer g such that g is a divisor of both m and n.