gcd algorithm (extended-euclid)

gcd-euclid.m

%{
    Problem 7 (ii) - extended-euclid function

    Given two integers a and b, it finds the largest integer that 
    divides both of them - known as their greatest common divisor (gcd).

    Input: integers a and b where a >= b >= 0
    Output : gcd(a, b)
%}
function result = euclid (a, b)
    if (b == 0)
        result = a
        return;
    end
    
    result = euclid(b, mod(a, b));
    return;
end