W_Heisenberg
Full Member level 4
- Joined
- Feb 27, 2011
- Messages
- 217
- Helped
- 6
- Reputation
- 12
- Reaction score
- 6
- Trophy points
- 1,298
- Location
- Boston
- Activity points
- 2,575
When doing DFT (Discrete Fourier Transform), it is said that the complexity is N^2
and for FFT, it is NlogN
how do we get this?
and for FFT, it is NlogN
how do we get this?