Homework 12Details| Problem | Grading
|
|---|
| A | ?
| | 8-10 or 8-25 | Algorithms Rubric
| | 8-16c or 8-17 | Algorithms Rubric
|
Problem A:
Problem 8-10 suggests giving an algorithm that runs in O(nM) time. Is that a polynomial-time algorithm with respect to the size of the input? Explain.
Note: When giving a dynamic programming algorithm, give a recursive formula and specify how the values will be computed to yield an efficient algorithm.
|