Algorithm to Find GCD of Two Numbers using Recursion

Algorithm fnGCD(x,y)
{
if(x>=y && x%y==0)
return y;
else
return (fnGCD(y, x%y));
} // End of Algorithm

Algorithm fnGCD(x,y)

{

if(x>=y && x%y==0)

return y;

else

return (fnGCD(y, x%y));

} // End of Algorithm