Each number is the sum of the two preceding ones. But did you know there are multiple ways to compute them, each with different speed, memory, and exactness trade-offs?

My solutions (in Python) for the problems from the Coursera course "Algorithmic Toolbox" (part of Data Structures and Algorithms specialization by UC San Diego).

This is a simple fibonacci number generator that takes an integer input from a user, then uses that input as the term of the fibonacci number to be generated. This program utilizes recursion and ...