linked list pretty show
1234567891011121314151617181920212223242526272829303132
{-# language GADTs #-}
data List a where
Nil :: List a
Cons :: (Show a, Ord a) => a -> List a -> List a
instance Show (List a) where
show list = "[ " ++ show' list ++ " ]"
lfoldr :: (a -> a -> a) -> List a -> a
lfoldr f Nil = error "empty List"
lfoldr f (Cons a (Cons b Nil)) = f a b
lfoldr f (Cons a as) = f a $ lfoldr f as
findMax :: List a -> List a
findMax Nil = Nil
findMax (Cons a Nil) = Cons a Nil
findMax (Cons a (Cons b ls))
| a > b = Cons a $ Cons b ls
| otherwise = findMax $ Cons b ls
show' :: List a -> String
show' (Nil) = ""
show' (Cons a Nil) = show a
show' (Cons a as) = show a ++ " -> " ++ show' as
selectSort :: List a -> List a
selectSort = undefined
main = do
print $ lfoldr max $ Cons 1 $ Cons 2 $ Cons 3 Nil
print $ findMax $ Cons 1 $ Cons 3 $ Cons 2 $ Cons 1 Nil
Haskell
INFO