The Euclidean algorithm

This is a discussion on The Euclidean algorithm within the General AI Programming forums, part of the Cprogramming.com and AIHorizon.com's Artificial Intelligence Boards category; hey guys ...
i am a new member and i want some help in a pseudo-code
i was asked to ...

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"

And this is my Answer

Code:

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

Is this Code correct??
and is it not could any one tell me why it is not correct and what is the correct code ??
i'm waiting guys

Until you can build a working general purpose reprogrammable computer out of basic components from radio shack, you are not fit to call yourself a programmer in my presence. This is cwhizard, signing off.