Write gcd(a, b) using Euclid's algorithm with a while loop.
gcd(a, b)
while
gcd(48, 18) → 6
gcd(7, 3) → 1
Submit runs 5 tests, including hidden edge cases.
Each hint gives a little more help. Try on your own first.
Run your code to see the output here.