abstract algebra - Euclidean Domain and algorithm questions

If $R$ is a Euclidean Domain. Describe an algorithm for computing the greatest common divisor of two non-zero elements $a$ and $b$ of $R$.

Would this just be the Euclidean algorithm?

Also why does the algorithm terminate and return to the correct answer?