3 ms·I'd assumed fft was just a dft with O(n log(n)) performance - am I missing something?by vmilner 5y agoI'd assumed fft was just a dft with O(n log(n)) performance - am I missing something?wnoise 5y agoYou're not. The FFT is just a particular way of implementing the DFT.vmilner 5y agoQuite. So I'm puzzled by what mistake the 'skilled programmers' are making, when confusing DFT and FFT. Implementing DFT in quadratic time?