Homework Assignment #1

Due: 9/5/02 (Thursday)

The assignment consisted of writing two programs to solve the binomial coefficient. They are:

1) Use the memoization technique with a 2D array initialized to all -1s. This should be a recursive program that is similar to the divide-and-conquer algorithm, but uses the memoization technique to avoid redundant work.

2) Modify the 2D array dynamic programming Algorithm 3.2 of the textbook to work with a 1D array to save storage. We can do this since the 2D array never needs more that the previous row when filling the next row.