The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Why it was recommended
It derives the FFT algorithm from polynomial multiplication and it’s fantastic . I rewatch it every 6 months or so.
Strong recommendationtverbeure · Original
What it covers
Reducible's visual walkthrough of the Fast Fourier Transform, motivated by polynomial multiplication. It shows how the FFT's key ideas can be discovered by asking the right. It is for someone who already knows the basic terms and wants the next step.
Video details
- Channel
- Reducible
- Length
- 28 min 23 sec
- Year
- 2020
More in this topic
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
- The Fastest Way to Board a Plane Feels Like the Slowest