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

5 votes453 views3 answers
Get tail of list haskell
Haskell
0 vote269 views1 answer
Haskell any function
Haskell
0 vote231 views1 answer
Fibnocci code in haskell language
Haskell
0 vote266 views1 answer
Haskell return false if list empty
Haskell
0 vote238 views1 answer
Words haskell code
Haskell
0 vote253 views1 answer
Drop haskell
Haskell
1 vote449 views1 answer
Quicksort in haskell
Haskell
5 votes442 views2 answers
Haskell get last element of list
Haskell
3 votes434 views1 answer
Haskell multiline comment
Haskell
18 votes423 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell