undefined | Better HN

0 pointsvmilner4y ago0 comments

I'd assumed fft was just a dft with O(n log(n)) performance - am I missing something?

0 comments

You're not. The FFT is just a particular way of implementing the DFT.

Quite. So I'm puzzled by what mistake the 'skilled programmers' are making, when confusing DFT and FFT. Implementing DFT in quadratic time?

j / k navigate · click thread line to collapse

0 pointsvmilner4y ago0 comments

I'd assumed fft was just a dft with O(n log(n)) performance - am I missing something?

You're not. The FFT is just a particular way of implementing the DFT.

vmilnerOP4y ago

Quite. So I'm puzzled by what mistake the 'skilled programmers' are making, when confusing DFT and FFT. Implementing DFT in quadratic time?

j / k navigate · click thread line to collapse