Copyright 2004 Ken Greenebaum
Computational Complexity
nFFT (Fast Fourier Transform)
nO= nlog(n)
nFast Wavelet Transform
nLinear
nO= n