It covers basic algorithm design techniques such as divide and conquer, dynamic programming ... algorithms for greedy scheduling and Huffman codes. We will also learn some interesting cases when being ...