Basic Euclidean Algorithm to find GCD of two numbers using modulo operator