Question: 
Write a python function to find gcd of two positive integers.


Model's Code:
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a



Sample Correct Code:
def gcd(x, y):
    gcd = 1
    if x % y == 0:
        return y
    for k in range(int(y / 2), 0, -1):
        if x % k == 0 and y % k == 0:
            gcd = k
            break  
    return gcd


Asserts:
assert gcd(12, 17) == 1
assert gcd(4,6) == 2
assert gcd(2,9) == 1


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

Test 498 of 974: 367/498 (73.69477911646585%): success