Video details loaded
HomeMIT 6.046J Design and Analysis of Algorithms, Spring 2015Lecture 3: Divide & Conquer: FFT
MIT 6.046J Design and Analysis of Algorithms, Spring 2015

Video 4 of 10

Previous: Recitation 1: Divide & Conquer: Smarter Interval Scheduling, Master Theorem, Strassen's AlgorithmNext: Recitation 2: B-trees

Lecture 3: Divide & Conquer: FFT

1:20:52

Up Next

Recitation 2: B-trees

Continue

Description: In this lecture, Professor Demaine continues with divide and conquer algorithms, introducing the fast fourier transform.

Instructors: Erik Demaine