COSC 311 Homework 10/5/2017   Measuring time fibonacci sequence using memo-ization

Distributed: Thurs 10/5/2017
Due: Mon 10/9/2017

Write a Java program to compute the result of calls to Fibonacci function
and the execution time of the Fibonacci function. The results of invocations of
the fibonnaci function must be memo-ized in a static 1D array, and those results
must be used whenever possible to compute the Fibonnaci number.

Compute the Fibonacci number for n = [0 .. k]. The upper limit, k, is the
same upper limit as used for HW 10/02. 

Execution time will include the time to make calls and returns. It will
not include anything extraneous to computing the value; N.B. time for I/O
must not be included, time for computing next parameter value must not be
included. 
  
Output: The LAST 10 values of the Fibonacci sequence and execution time. 
The parameter value must be included to properly label the function value 
and execution time.

Analysis: Give a plot showing total execution time versus parameter value.
The axes must be labelled properly. 
Hand-drawn plot is not acceptable. At the very least, import the values
to an excel spreadsheet and plot.

--------------------------------------------------------------------------

Constraints:
(1) URL of java file must appear in file header


Points taken off for:
(1) Doesn't work
(2) Failure to meet constraints
(3) Code does not match output
(4) Ugly or difficult to understand code