{- |
Description: Greatest common divisor
Copyright: Copyright (C) 2021 Yoo Chung
License: GPL-3.0-or-later
Maintainer: dev@chungyc.org

Part of Ninety-Nine Haskell "Problems".  Some solutions are in "Solutions.P32".
-}
module Problems.P32 (myGCD) where

import qualified Solutions.P32 as Solution

-- | Determine the greatest common divisor of two positive integer numbers.
-- Use [Euclid's algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).
--
-- === Examples
--
-- >>> myGCD 36 63
-- 9
--
-- >>> myGCD 125 81
-- 1
--
-- >>> myGCD 221 559
-- 13
myGCD :: Integral a => a -> a -> a
myGCD :: forall a. Integral a => a -> a -> a
myGCD = a -> a -> a
forall a. Integral a => a -> a -> a
Solution.myGCD