Using your software, compute a set of Fibonacci numbers employing the four techniques (c.f. 2, above); for example, use n: {10, 15, 40, 41, 42, 50, 60, 100, 500, 600}. a) Measure the time for each computation—send the results to a file. * Recommend using the Chrono library from C++
please I do not know how to solve the number 3 and 4 please solve
Study the Fibonacci number sequence in the following forms: (1) iterative (sequential), (2) recursive, (3)
and closed form solution.
2) Implement each Fibonacci form (1, 2, and 3 see above) in the C++ language (C++ 17).
Write four functions:
a) An iterative function that accepts a non-negative integer n and returns the nth Fibonacci number.
b) A recursive function that inputs a non-negative integer n and returns the nth Fibonacci number.
c) An improved recursive function that employs dynamic
d) The closed form of the Fibonacci sequence (be sure to reference the golden ratio)
3) Using your software, compute a set of Fibonacci numbers employing the four techniques (c.f. 2, above);
for example, use n: {10, 15, 40, 41, 42, 50, 60, 100, 500, 600}.
a) Measure the time for each computation—send the results to a file.
* Recommend using the Chrono library from C++
b) Make certain you have “sufficient” data for convincing results.
4) Import your data (from 3) to excel for easy graphing
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
