It should be a O(n log n) rather than O(n^2), so the speed increase for large n, which can be common n signal processing, is real. If you think of FFT/IFFT onl

It should be a O(n log n) rather than O(n^2), so the speed increase for large n, which can be common n signal processing, is real. If you think of FFT/IFFT only working for special cases, then works in the general sense.