skip to main
|
skip to sidebar
Haskell Problems Solved..
haskell code.
Friday, February 27, 2009
fibonacci sequence in haskell : not very efficient
fib :: Int -> Int
fib n
| n == 0 = 0
| n == 1 = 1
| n > 1 = fib (n - 2) + fib (n - 1)
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
Blog Archive
▼
2009
(13)
►
June
(3)
▼
February
(10)
Raising a number to the power of another number. e...
finding the highest common factor/divisor for two ...
fibonacci sequence in haskell : not very efficient
Integer square root of a positive integer in haskell
Using recursive addition to multiply in haskell
Finding the factorial in haskell.
finding out how many are equal amongst three numnb...
Finding max of two, three or four in haskell
Finding the number of roots in a quadratic equatio...
Finding the average of three numbers in haskell
No comments:
Post a Comment