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

0 vote455 views1 answer
Point free style haskell
Haskell
18 votes434 views4 answers
Client does not support authentication protocol requested by server; consider upgrading MySQL client
Haskell
5 votes450 views3 answers
Get tail of list haskell
Haskell
1 vote455 views1 answer
Haskell code
Haskell
0 vote386 views1 answer
Haskell any function
Haskell
0 vote373 views1 answer
Haskell int to text
Haskell
0 vote332 views1 answer
Can you partially define a tuple in haskell
Haskell
0 vote421 views1 answer
Haskell merge lists
Haskell
0 vote393 views1 answer
Fibnocci code in haskell language
Haskell
0 vote407 views1 answer
Can't do a reify in the IO monad
Haskell