The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Reducible · 7 则 HN 推荐
视频问答
可以让 AI 解释当前片段，或总结整部视频。如果回答附有时间戳，点击即可跳到对应片段。
试着问：这里讲的是什么意思？
需要用 Google 登录。确认前可查看最多会扣除多少积分。
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 questions.
HN 推荐的原因： HN repeatedly calls it a fantastic explanation that made FFT click, with some rewatching it periodically.
“It derives the FFT algorithm from polynomial multiplication and it’s fantastic . I rewatch it every 6 months or so.” 阅读 HN 讨论 ↗