here it has nothing to do with what a Fourier Transform results in. But like FFT it's speed is O(n), while the speed of plain old "school" multiplication and DFT is O(n²).
I suppose in fact it's o(n * ln(n) )
-Michael _______________________________________________ fpc-devel maillist - [email protected] http://lists.freepascal.org/mailman/listinfo/fpc-devel
