nickserv · November 18, 2013 20:26
diff --git a/euler1.hs b/euler1.hs
 divisible x y = x `mod` y == 0

 main = print $ sum [x | x <- [1..999], x `divisible` 3 || x `divisible` 5]
diff --git a/factorial.hs b/factorial.hs
 factorial 1 = 1
 factorial n = n * factorial (n-1)

 main = print $ factorial 5
diff --git a/reverse.hs b/reverse.hs
 -- |Reverses a list (top level elements only).
 reverse2 :: [a] -> [a]
 reverse2 [] = []
 reverse2 list = reverse2 (tail list) ++ [head list]

 main = print $ reverse2 ["g", "f", "e", "d", "c", "b", "a"]
	divisible x y = x `mod` y == 0

	main = print $ sum [x \| x <- [1..999], x `divisible` 3 \|\| x `divisible` 5]
	-- \|Reverses a list (top level elements only).
	reverse2 :: [a] -> [a]
	reverse2 [] = []
	reverse2 list = reverse2 (tail list) ++ [head list]

	main = print $ reverse2 ["g", "f", "e", "d", "c", "b", "a"]