def gcd(a,b):
    """
    gcd computes the greatest common denominator of the two given numbers
    using Euclid's algorithm.

    Args:
        a (int): The first number.
        b (int): The second number.

    Returns:
        The integer result.
    """
    if b == 0:
        return a
    else:
        return gcd(b, a % b)