You mean, like this? :

# Compute the Greatest Common Divisor.
def gcd(a,b)
    return a if b == 0
    return gcd(b, a % b)
end

On Thu, Mar 13, 2003 at 09:57:25AM +0900, Mattia Peronio wrote:
> Please, I need an example of recursive function with 2 or more 
> parameters, i.e. the euclidean formula for maximum common divisor.
> thank you very much,
> Mattia
> 
> 
> 
> 
> 

-- 
Daniel Carrera
Graduate Teaching Assistant.  Math Dept.
University of Maryland.  (301) 405-5137