Replace the recursive methods in project 1 with an iterative method that computes the function P. Determine whether the iterative solution is significantly more efficient than the recursive one by running both programs for a series of different values of n and examining the value of the counter.

Project 1

Write a program that displays the nth term of the function P defined in Programming Exercise 12. Incorporate the methods you wrote for the first two programming exercises into a class that implements the Sequence interface defined in this chapter. Increment the counter of Sequence each time either method is called. Make use of the SequenceWindow class presented in this chapter in your solution.

Exercise 12

Referring to the nth term of the arithmetic progression defined in the previous exercise as p(n), write a recursive method that computes another sequence defined by the formula:

What sequence of numbers is produced by P?