Method inverseFFT

src/main/java/com/thealgorithms/maths/FFT.java:244–252

(int n, boolean inverse, ArrayList<Complex> x)

    /* Divide by n if we want the inverse FFT */
    public static ArrayList<Complex> inverseFFT(int n, boolean inverse, ArrayList<Complex> x) {
        if (inverse) {
            for (int i = 0; i < x.size(); i++) {
                Complex z = x.get(i);
                x.set(i, z.divide(n));
            }
        }
        return x;
    }

    /**
     * This function reverses the bits of a number. It is used in Cooley-Tukey