greatest common divisor using recursion in python

gcdRecur.py

def gcdRecur(a, b):
    '''
    a, b: positive integers
    
    returns: a positive integer, the greatest common divisor of a & b.
    '''
    # Your code here
    low = min(a,b)
    high = max(a, b)
    if high%low == 0:
        return low
    remainder = high%low
    return gcdRecur(low, remainder)