Analyses on Fibonacci
Read the full description in
Towards a discipline of dynamic programming
.
Note: Input
n
is represented by a list of length
n
. Each list of length
n
gives rise to
F(n)
parses, therefore
F(n)
is computed by the counting algebra.