99 questions/Solutions/4

From HaskellWiki
< 99 questions‎ | Solutions
Revision as of 15:02, 25 October 2011 by KernelJ (talk | contribs)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

(*) Find the number of elements of a list.

myLength           :: [a] -> Int
myLength []        =  0
myLength (_:xs)    =  1 + myLength xs
myLength'    =  foldl (\n _ -> n + 1) 0
myLength''   =  foldr (\_ n -> n + 1) 0
myLength'''  =  foldr (\_ -> (+1)) 0
myLength'''' =  foldr ((+) . (const 1)) 0
myLength' xs = snd $ last $ zip xs [1..] -- Just for fun
myLength = sum . map (\x -> 1)

This is length in Prelude.