99 Elm Problems/Problem 32

Determine the greatest common divisor of two positive integer numbers. Use Euclid's algorithm.

# # # THIS IS A STUB # # #

Example in Elm:

Result:

Solutions