explainer · HACKER NEWS RECOMMENDATION
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Reducible · 7 HN recommenders · 8 recommendation months
Recommended by 7 Hacker News commenters across 8 months (2021–2026).
SignalTube analysis
Among 11 other explainer videos tagged Algorithms & data structures, the mean is 3.8 distinct HN recommenders. This video has 7 distinct HN recommenders, about 1.8× that mean. Recommendations span 8 distinct months, longer than the peer average of 3.1 months. This is a data-derived comparison, not a human review or quality rating.
89% of its 9 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2021–2026; those years describe discussion history, not upload date. Its verified runtime is 28 minutes 23 seconds. YouTube lists its publication date as 2020-11-14.
- Channel / speaker
- Reducible
- Verified runtime
- 28m 23s
- YouTube upload date
- 2020-11-14
- Hacker News mention years
- 2021–2026
SAME TOPIC AND FORMAT
Compare with related videos
The comparison cohort uses other explainer videos in Algorithms & data structures. “Shared recommenders” counts HN users who recommended both videos in the source graph.
| Video | HN recommenders | Recommendation months | Positive label share | Shared recommenders | Runtime | Upload date |
|---|---|---|---|---|---|---|
| The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?Current video | 7 | 8 | 89% | — | 28m 23s | 2020-11-14 |
| The Fastest Way to Board a Plane Feels Like the Slowestexplainer · CGP Grey | 9 | 6 | 69% | No recorded overlap | 8m 28s | 2019-02-04 |
| 30 Weird Chess Algorithms: Elo Worldexplainer · suckerpinch | 8 | 6 | 62% | No recorded overlap | 42m 36s | 2019-07-15 |
| The Most Underrated Algorithmexplainer · Veritasium | 5 | 3 | 56% | 1 (14%) | 26m 33s | 2022-11-03 |
THREE SOURCE-BASED CONTEXT POINTS
Why Hacker News recommends it
Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.
The archive classifies this as a recommendation in “Understanding the FFT Algorithm (2013)”. Its short rationale: Intuition for how FFT works in 30 minutes.
The archive classifies this as a strong recommendation in “Discrete Fourier Transform”. Its short rationale: Fantastic FFT explanation.
The archive classifies this as a strong recommendation in “Convolutions, Fast Fourier Transform and polynomials (2022)”. Its short rationale: Derives FFT from polynomial multiplication.