Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
folder
folder :: (a->a->a) -> a -> [a]-> a folder (#) e [] = e folder (#) e (x:xs) = x # folder (#) e xs --product = folder (*) 1 --and = folder (&&) True --sum = folder (+) 0 --or = folder (||) False main = print $ folder (+) 1 [1,4,7,3,67]
run
|
edit
|
history
|
help
0
hard 1.1
Removed input
mySqrt
Haskell Fibonacci Numbers
appending and prepending list
Split into n distinct parts
equiv
Factorial in haskell
Kleinste
Is Preorder BST