Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
haskell
--ghc 7.10 --Initial functions squareEq :: Integer -> Integer -> Integer -> Integer squareEq a b c = a^2 + b^2 + c^2 inc a = a+1 --------------------------------------------------- --factorial f :: Integer -> Integer f 0 = 1 f x = x* f(x-1) --length len :: [a] -> Int len [] = 0 len (x:xs) = 1 + length xs --------------------------------------------------- x = map f [0..3] y = len [1..5] --test test :: Integer -> Integer test 1 = 1 test a = a + test (a-1) z = test 4 --------------------------------------------------- w = [x | x <- [1..20], x`mod`2 == 0] --------------------------------------------------- minorBigger ks = [if k < 10 then "MINOR" else "BIGGER" | k <- ks, odd k] minor = minorBigger [1..20] --------------------------------------------------- differentOf xs = [x | x <- xs, x /= 2, x/= 10, x/= 15] dif = differentOf [1..20] --------------------------------------------------- fibonacci :: Integer -> Integer fibonacci 0 = 0 fibonacci 1 = 1 fibonacci x = fibonacci (x-1) + fibonacci (x-2) --------------------------------------------------- main = print(x, y, z, w, minor, dif, fibonacci 11)
run
|
edit
|
history
|
help
0
Split into n distinct parts
haskell linked list
Factors of a number, prime numbers
folder
tried some polynoms 2: now with some `*` and foldr(-p)
prettier Tasty
Square root
divisibleBy a b
New wall
ex3