Hacker News new | ask | show | jobs
by vmilner 1868 days ago
I'd assumed fft was just a dft with O(n log(n)) performance - am I missing something?
1 comments
wnoise 1868 days ago
You're not. The FFT is just a particular way of implementing the DFT.
link
vmilner 1868 days ago
Quite. So I'm puzzled by what mistake the 'skilled programmers' are making, when confusing DFT and FFT. Implementing DFT in quadratic time?
link