COSC 311  Homework 10/17/2016  Recursive Fibonacci - saving results
Distributed: 10/17/2016
Due: 10/24/2016

Write the recursive implementation of the Fibonacci function that uses a table
of calculated results to reduce computation time.

The table starts with these initializations:
fib[0] = 1
fib[1] = 1

Before calculating fibonacci(k), first check the table to see if it has already been
calculated. 
  If so, then use the previously calculated value. 
  If not, then calculate fibonacci(k) and enter the value to the table.

The table of calculated results is static.

The main program invokes fib() as follows (any valid k value):
public static void main (String [] args) {
   int k = 10;                  // k >= 0
   int result = fibonacci(k);
   }
   
Constraints on the code:
  -- Do not use any Java objects or classes beyond char stream I/O. 
    
Turn in:
  Hardcopy of your code.
  In your code, include a header:
      [your name]
      [URL of code]
      COSC 311
      HW 1017
      FALL 2016.
  Do not supply UML diagram for your code.