完整快速傅里叶变换代码(参考:blog.csdn.net/tuwenqi20) void fft(complex x[], int N, complex* W) { complex up, down, product; change(x, N); //调用变址函数 int size = log(N) / log(2); for (int M = 0; M < size; M++) //第M级 { int l = 1 << M; for (int j = ...