Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2014:journals:fred:home [2014/03/04 23:28] – gisaf | courses:cs211:winter2014:journals:fred:home [2014/04/02 01:40] (current) – gisaf | ||
|---|---|---|---|
| Line 74: | Line 74: | ||
| + | [[5.1 The Mergesort Algorithm]] | ||
| + | |||
| + | [[5.2 Further Recurrence Relations]] | ||
| + | |||
| + | |||
| + | [[5.3 Counting Inversions]] | ||
| + | |||
| + | |||
| + | [[5.4 Finding the Closest Pair of Points]] | ||
| + | |||
| + | |||
| + | [[6.1 Weighted Interval Scheduling(A Recursive Procedure)]] | ||
| + | |||
| + | |||
| + | [[6.2 Principles of Dynamic Programming(Memoization or Iteration over Subproblems)]] | ||
| + | |||
| + | |||
| + | [[6.3 Segmented Least Squares(Multi-way Choices)]] | ||
| + | |||
| + | |||
| + | [[6.4 Subset Sums and Knapsacks(Adding a Variable)]] | ||
| + | |||
| + | |||
| + | [[7.1 The Maximum-Flow Problem and the Ford-Fulkerson Algorithm]] | ||
| + | |||
| + | |||
| + | [[7.2 Maximum Flows and Minimum Cuts in a Network]] | ||
| + | |||
| + | |||
| + | [[7.5 A First Application(The Bipartite Matching Problem)]] | ||
| + | |||
| + | |||
| + | [[7.7 Extensions to the Maximum-Flow Problem]] | ||
