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 討論 ↗