The greatest common divisor of two integers is the largest positive integer that divides them both. This article considers two algorithms for computing \hbox{gcd}(u,v), the greatest common divisor of u and v.