| Copyright | Copyright (C) 2021 Yoo Chung |
|---|---|
| License | GPL-3.0-or-later |
| Maintainer | dev@chungyc.org |
| Safe Haskell | Safe-Inferred |
| Language | GHC2021 |
Solutions.P32
Description
Some solutions to Problems.P32 of Ninety-Nine Haskell Problems.
Documentation
myGCD :: Integral a => a -> a -> a Source #
Determine the greatest common divisor of two positive integer numbers. Use Euclid's algorithm.