Much Progress

Wow--I've made a great deal of progress today, and my report is starting to look less like a skeleton and more like a finished product.

I wrapped up my number theory algorithms section and took another chunk out of the graph algorithms section. Most of these are really specific algorithms, unlike the ones I focused on in the first week. This means that they are pretty much unchanged when applied to a problem.

My plan for the rest of the week is clear: I've decided on a few more algorithms to cover, and I'll also be revisiting some I've already written about, to clarify with more examples. A big priority is returning to the four main techniques: Complete Search, Greedy, Divide-and-Conquer, and Dynamic Programming. I left them to the end because they're more broad than the number theory, geometric, and graph algorithms--but they're also some of the most helpful.