15 - 12 Feb - Stable Matchings 07- 22 Jan - Divide and Conquer 10 - 29 Jan - Recursion Part 2 05 - 18 Jan - The Sorting Wrap-Up 02 - 04 Jan - Sorting (Continued) 08 - 25 Jan - Divide and Conquer 06 - 20 Jan - Divide and Conquer 13 - 06 Feb - Dynamic Programming 00 - 30 Dec - Introduction 01 - 01 January - Sorting 14 - 08 Feb - Dynamic Programming 11 - 03 Feb - From Recursion to Dynamic Programming 09 - 27 Jan - Recursion Part 1