|
|
|
|
|
|
by bmm6o
548 days ago
|
|
|
Right. Also note that the non-optimized implementation boils down to computing F(n) = 1+1+1+1+...+1, with a function call tree that has 2F(n) nodes. So no matter what the relative cost is for addition and function calls, the total time should go like F(n). |
|
|