• Section 4.7

Note that this section discusses the running problem we used in class for greedy algorithms, although with a very small twist. (Essentially, they consider edge weights to be “dissimilarities” rather than “similarities”.)

Next up, we’ll be reading Chapter 5. We’ll work through 5.1-5.4. We’ll also discuss the Master Theorem.

(Without mentioning it specifically, Section 5.2 of the textbook describes many pieces needed to derive the Master Theorem.)