# The Euclidean algorithm

• 10-26-2009
the_storm
The Euclidean algorithm
hey guys ...
i am a new member and i want some help in a pseudo-code
i was asked to write a pseudo-code for the Euclidean algorithm
this was the question
" The euclidean algorithm determines the greatest common divisor (GCD) of two positive numbers by repatedly replacing the larger number with the result of subtracting the smaller one from it until the two numbers are equal"

```Get x,y //x,y any numbers set gcd to 0 //gcd = Great Common divisor if (x>0) and (y>0)   then if (x-y) > 0             then while (x>y)                     { set gcd to ( gcd + (x-y) )                       set x to x-y                     }                     print " the GCD" + gcd               else if (y-x) > 0                     then while (y>x)                           { set gcd to ( gcd + (y-x) )                             set y to (y-x)                             }                             print "the GCD "+ gcd                       else print " the numbers are equal"                       end if               end if   else print " There is a negative number at least " end if```