What are advantages of using Euclid algorithm over prime decomposition to find the gcd of two numbers? Should you use Euclid’s algorithm in some cases and prime decomposition in others?
If the numbers have relatively small factors, that are easy to find, then prime factorization is easier. But if they don't, then the Euclidean algorithm is easier.