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:

import Html exposing (text)
import List

f : Int -> Int
-- your implementation goes here

main = text (toString (f 0))

Result:

4

Solutions