Graphing the execution times of different Fibonacci algorithms
Time complexity: O(n²)
Uses the classic recursive form of the Fibonacci function,
F(n) = F(n - 1) + F(n - 2)
Time complexity: O(n)
Uses two variables to keep track of the two previous values, adding them together each iteration
Time complexity: O(1)
Uses a variation of Binet's Formula,
F(n) = (φⁿ⁺¹ - (1 - φ)ⁿ⁺¹) / √5
