function transform(real, imag) {
    if (real.length !== imag.length)
        throw "Mismatched lengths";

    var n = real.length;
    if (n === 0)
        return;
    else if ((n & (n - 1)) === 0) // Is power of 2
        transformRadix2(real, imag);
    else // More complicated algorithm for arbitrary sizes
        transformBluestein(real, imag);
}
/* 
 * Computes the discrete Fourier transform (DFT) of the given complex vector, storing the result back into the vector.
 * The vector can have any length. This is a wrapper function.
 */
Computes the discrete Fourier transform (DFT) of the given complex vector, storing the result back into the vector.
The vector can have any length. This is a wrapper function.
Computes the discrete Fourier transform ( DFT ) of the given complex vector storing the result back into the vector . The vector can have any length . This is a wrapper function .
function transform(real, imag) {
    if (real.length !== imag.length)
        throw "Mismatched lengths";
    var n = real.length;
    if (n === 0)
        return;
    else if ((n & (n - 1)) === 0) 
        transformRadix2(real, imag);
    else 
        transformBluestein(real, imag);
}
function transform ( real , imag ) { if ( real . length !== imag . length ) throw "Mismatched lengths" ; var n = real . length ; if ( n === 0 ) return ; else if ( ( n & ( n - 1 ) ) === 0 ) transformRadix2 ( real , imag ) ; else transformBluestein ( real , imag ) ; }
Computes the discrete Fourier transform (DFT) of the given complex vector, storing the result back into the vector.
Computes the discrete Fourier transform ( DFT ) of the given complex vector storing the result back into the vector .
// Is power of 2 // More complicated algorithm for arbitrary sizes