Calculating Running Time Report

Problem: Compare and contrast running times for an iterative and a recursive implementation of the kth Fibonacci number. Assume the series is 0, 1, 1, 2 ….. ( In java or C++) (as you prefer)

Since the code is everywhere this should not take that long.

Proof:

Submit your code files as a tar.gz file to ——-

Write a short reflection paper that covers the following:

How you are calculating running times include how you know that you are getting valid dataWhat the running times are – graphically and raw data

Summary of results – with compare & contrast. This is the meat of the paper.