The following will be discussed in this chapter: Divide and Conquer - FFT, Randomized algorithms; optimization - greedy and dynamic programming; network flow; intractibility (and dealing with it); sublinear algorithms, approximation algorithms. | Lecture Design and Analysis of Algorithms - Lecture 1 Introduction