This is an old revision of the document!


Chapter 6 Front Matter and Section 6.1: Weighted Interval Scheduling, a Recursive Approach

The basic idea behind dynamic programming is similar to that of divide and conquer and opposite to that of greedy: dynamic programming divides the problem into subproblems and then takes the solutions to those to create the solution to the larger problem.

courses/cs211/winter2018/journals/holmesr/section_6.1.1522116824.txt.gz · Last modified: by holmesr
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0