Video details loaded
HomeMIT 6.046J Design and Analysis of Algorithms, Spring 2015Lecture 2: Divide & Conquer: Convex Hull, Median Finding

Lecture 2: Divide & Conquer: Convex Hull, Median Finding

1:20:35

Up Next

Recitation 1: Divide & Conquer: Smarter Interval Scheduling, Master Theorem, Strassen's Algorithm

Continue

Description: In this lecture, Professor Devadas introduces divide-and-conquer algorithms and problems that can be solved using divide-and-conquer approaches.

Instructor: Srinivas Devadas