prog3 - the principle of optimality to decompose the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science 130B Winter 2007 Programming Assignment #3 Due: 11:59pm, Sunday March 4th Solve the same problem as in the previous assignment using dynamic programming. The need for a diFerent solution arises because the greedy method does not guarantee the optimal solution. To solve the triangulation problem using dynamic programming, you must apply
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the principle of optimality to decompose the problem into smaller subproblems. You must develop a recurrence relation to recursively build up the optimal solution from those of the smaller problems. Your program should use the recurrence relation to construct a table of partial solutions....
View Full Document

Ask a homework question - tutors are online