Haskell max function

-- fold the list:

maximum' :: Ord a => [a] -> a
maximum' = foldr1 (\x y ->if x >= y then x else y)

--For the recursive version (no double checking):

maximum'' :: Ord a => [a] -> a
maximum'' [x]       = x
maximum'' (x:x':xs) = maximum' ((if x >= x' then x else x'):xs)

-- If you want wards:

maximum'' :: Ord a => [a] -> a
maximum'' [x]       = x
maximum'' (x:x':xs) | x >= x'   = maximum' (x:xs)
maximum'' (x:x':xs) | otherwise = maximum' (x':xs)

Source: stackoverflow.com

Similar codes

4 votes220 views2 answers
Haskell append to list
Haskell
0 vote243 views1 answer
Drop haskell
Haskell
0 vote230 views1 answer
Haskell list element at index
Haskell
18 votes279 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell
1 vote280 views1 answer
Quicksort in haskell
Haskell
0 vote308 views1 answer
\n dont work in haskell
Haskell
0 vote240 views1 answer
Words haskell code
Haskell
0 vote228 views1 answer
Delete a as haskell
Haskell
4 votes306 views2 answers
INFRAME CODE
Haskell
0 vote249 views1 answer
Concat two integers haskell
Haskell