Chapter 13, Problem 27PE

Program Plan Intro

Recursive computation of Fibonacci numbers

Program plan:

Filename: “FastFibComputer.java”

This program file is used to define a class “FastFibComputer”. In the code,

• Define a class “FastFibComputer”.
  • Declare class member array list“knownValues”.
  • Define a constructor “FastFibComputer()”.
    • Initialize the “knownValues”.
  • Define a method “fib()”.
    • If “n” is less than array list and the value accepted is not null.
      • Return the value.
        • Call the method “fib()”recursively
        • Iterate a “while” loop.
        • • Add “null” to array list.
        • Feed values to “knownValues”.
        • Return the value of “r”.

Filename: “FastFibComputerDemo.java”

This program file is used to define a class “FastFibComputerDemo”. In the code,

• Define a class “FastFibComputerDemo”.
  • Define a method “main()”.
    • Create the object “ffc” of class “FastFibComputer”.
    • Call the method “fib()” and print the value.
    • Print the expected result.
    • Call the method “fib()” and print the value.
    • Print the expected result.