Pseudo code for Euclid's subtraction algorithm ?

Question

Pseudo code for the Euclid's algoritm fo finding the gcd(m,n) using subtraction........

Answer 1

function gcd(a, b)
 while b ≠ 0
  if a > b
   a := a - b
  else
   b := b - a
 return a

Answer 2

Let the variable be U and V

1. Read u and v
2. If v>u then interchange values
3. Do until v <= 0
a. u = u - v
b. If v .> u then interchange values
c. Continue
4. Answer on u