Open course ware

[SQUEAKING] [RUSTLING] [CLICKING] JUSTIN SOLOMON: So today, we're going to continue in our discussion of dynamic programming. I actually found this set of problem session problems to be easier than the previous one. There's a funny thing, which is we learned in class about pseudo polynomial time style dynamic programs. Somehow, that language is a little bit liberating, in the sense that you're using parameters that you really shouldn't, when it comes to the runtime of your algorithm. Well, I suppose we should, in the sense that it's allowed, if you call your algorithm pseudo polynomial time. But it somehow makes it a little easier to formulate your dynamic programming algorithm, because all the numbers are staring you right in the face. You don't have to be so careful about what's fair game and what's not, when you post your algorithm so long as it's efficient in the values that you care about. And so today's problem session has fiv...

[SQUEAKING] [RUSTLING] [CLICKING] JUSTIN SOLOMON: Right, so today is going to be our first, I believe, of two problem sessions covering dynamic programming. I've learned dynamic programming is one of these interesting parts of an algorithms class where, somehow, the people that are really good at it are completely disjoint with the people that are good at all the other parts of the algorithms class. So for some of you guys, that might be promising, and for others, maybe a little bit less so. So maybe we'll spend just a minute or two reviewing the basic ideas we're going to apply in these problems because they'll follow, more or less, the same template. Although, of course, as usual in 6.006, we like to put some interesting window dressing around it so that it's not totally obvious what you're doing. And then we'll do a bunch of sample problems. Right. So let's talk a little bit about dynamic programming and the basic idea here. So, dynamic ...