EfficientGcd Uses the principle of recursion to find the GCD which when done by prime factorization has a higher run time.