Learning hook - Digital Technologies Hub

Recursion algorithms for Fibonacci are notoriously inefficient. Students should also observe that the times are much shorter when the timer is started in the function itself. As in example program: Fibonacci 2 (PY)and not in the main program as is the case in example program: Fibonacci 1 (PY) Students report their findings. ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download