public int gcdRec(int num1, int num2){
        if(num1 == 0){
            return num2;
        }
        return gcdRec(num2%num1, num1);
    }
assumption that num1 is less than num2 as initial parameter
src/com/interview/number/EuclideanAlgoForGCD.java