This video is from my Spring version of the course. Here are the Lecture 4 annotated slides.

The first few minutes of the lecture cover the substitution method for solving Recurrences, and the rest of the class focuses on examples of divide and conquer algorithms, including Arbitrage and the Closest pair of points algorithm.

To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video