The Most Underrated Algorithm
Veritasium · 2 位 HN 用户推荐 · 2022–2022
I think some insight into how that's possible is around the 8-minute mark of this video: [link]
— watersb, 2022The FFT takes the naive O(N^2) algorithm and makes it O(n log n) by bunching together repeated calculations, so if you have a million samples, that's some 70,000 times faster. At the time of its discovery it was critical for Fourier analysis to actually be reasonable to do on a computer, taking days instead of years. [0] [link] [1] [link] [2] [link]
— yunruse, 2022