Name: Anonymous 2011-03-01 9:13
Fibonacci(1) GET
fib 1 = 1
fib 2 = 1
fib n = fib (n - 1) + fib (n - 2)
main = (putStr . show) (fib 5)
*** Exception: stack overflow.
(define fib
(let* ((√5 (inexact->exact (sqrt 5)))
(φ (/ (add1 √5) 2)))
(lambda (n)
(round (/ (- (expt φ n) (expt (sub1 φ) n)) √5)))))
def fib(n):
return n == 1 and 1 or fib(n-1) + fib(n-2)(putStr . show) (fib 5)putStr (show (fib 5))(Show a, Show b, Show c) => Show (a, b, c)(Show a, Show b, Show c, Show d) => Show (a, b, c, d)(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)