public static void main(String args[]){
        EuclideanAlgoForGCD ea = new EuclideanAlgoForGCD();
        int gcd = ea.gcd(956,1044);
        if(gcd == 1){
            System.out.println("Co prime numbers");
        }else{
            System.out.println("No coprime numbers " + gcd);
        }
    }
assumption that num1 is less than num2 as initial parameter
src/com/interview/number/EuclideanAlgoForGCD.java