blob: 39c805db93bc28872f87a90d56f1cc4edc2c27f0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
||This program tabulates the values of `fib i' a function for computing
||fibonacci numbers, in a list `fibs'. Because the function is memoised
||(i.e. it uses table lookup when it recurses) it runs in linear time.
||To see the fibonacci numbers say.
|| test
fibs = map fib [0..]
fib 0 = 0
fib 1 = 1
fib (n+2) = fibs!(n+1) + fibs!n
test = layn (map shownum fibs)
||P.S. There is a more direct way of defining fibs, using a list comprehension
|| fibs = [a | (a,b) <- (0,1), (b,a+b) .. ]
||this also runs in linear time
|
