fft(odd);
for (int i = 0; i < l / 2; i++) {
float kth = Trig.toDegrees(-2 * i * Trig.PI / l);
Complex wk = new Complex(Trig.cos(kth), Trig.sin(kth));
c[i] = even[i].plus(wk.times(odd[i]));
c[i + l / 2] = even[i].minus(wk.times(odd[i]));
}
}
public static void ifft(Complex[] c) {