Skip to main content

4.1 due October 8

I understand the theory of this section I think, but I'm not sure how well that translates to being able to use it in practice. I can follow the example code in the book, but I don't think I could write it yet.

The coin problem is a little funny to read because I do it so differently in my head. You just use as many of the biggest coins as you can and then repeat for the next size down until you get to pennies. It works with our money system, but it baffles me it doesn't work for some others. And both ways to find the optimal number of coins, while good, seem overkill. (They aren't, because they would work with any money system. They just seem like they are because all of my experience says they are.)

Comments

Post a Comment

Popular posts from this blog

7.2 due November 19

The thing I didn't understand about this section is why we need to use a distribution Q instead of just sampling uniformly (which I guess is a distribution...) when we are trying to do rejection sampling. I think it is because it speeds things up as it will have fewer rejections than a rectangle would. This section seems like we are learning more of what we just learned. I understand most of it, but I'm not sure I would recognize when I should use any of the techniques in this section.
Post a Comment
Read more

4.2 due October 10

The hardest thing for me in this section is following all the details of actually implementing a search. The general "go here, then here, then here" makes sense, but keeping track of all the stacks and dictionaries and lists is what takes me the most time. I liked the cartoon example of what a depth first search would look like in real life. It both made me laugh and made me think.
Post a Comment
Read more