Tell how many elementary operations the given algorithm uses. (It depends on n.)
Algorithm for computing the nth Fibonacci number (defined in section 2.5)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.