Readings to finish for the week of Sep 24-Sep 30

Our upcoming readings for this week are: Sections 3.5, 3.6, 4.1, and 4.2. This will start you in on greedy algorithms. We’ll start working on greedy algorithms via a graph example, bridging the graphs and greedy algorithms sections.