Subject: Computing Fibonacci sequence
Date: Wed, 22 Oct 1997 10:08:27 -0400
From: "Ben"

Does anyone know for the recursive method of implementing the Fibonacci sequence, how many time Fib(n) is called for a given value of n?

For example, Fib(3) calls Fib 5 times and Fib(6) calls Fib 25 times.


|Reply| |Previous| |Next| |Down| |Exchange index| |Contents| |Store|

Copyright © 1996-2018 Alexander Bogomolny