Question: 
Write a function to find the greatest common divisor (gcd) of two integers by using recursion.


Model's Code:
def recur_gcd(a, b):
    if b == 0:
        return a
    return recur_gcd(b, a % b)



Sample Correct Code:
def recur_gcd(a, b):
	low = min(a, b)
	high = max(a, b)
	if low == 0:
		return high
	elif low == 1:
		return 1
	else:
		return recur_gcd(low, high%low)


Asserts:
assert recur_gcd(12,14) == 2
assert recur_gcd(13,17) == 1
assert recur_gcd(9, 3) == 3


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 687 of 974: 516/687 (75.10917030567686%): success