Assignment

In class, we discussed three ways to compute the $n_{th}$ term of the Fibonacci sequence:

Classic recursive

Iterative

Recursive with accumulators

Constant

Write a program in python that implements Fibonacci in each of the first three techniques and counts the number of addition operations when called.

Fill out the following table:

$\backslash$table$[[,,\backslash$table$[[$Number of$],[$addition$],[$operations in$...]]],[,$Fib$($n$),$Classic recursive,Iterative,$\backslash$table$[[$Recursive with$],[$accumulators$]]],[n=3,,,,],[n=10,,,,],[N=20,,,,]]$