[exercise] 6.4

Author: Dev-XYS

chapter06-Recursive-functions/4.hs

@@ -0,0 +1,7 @@
+euclid :: Int -> Int -> Int
+euclid 0 n = n
+euclid n 0 = n
+euclid m n | m < n = euclid m (n - m)
+ | otherwise = euclid (m - n) n
+
+{- The algorithm is slightly modified to process corner cases. -}