Fourier Transform, Fft, Fast Fourier Transform, Algorithms, Mathematics.
In case it is not a power of 2, then we can simply pad the remaining points with zeros to make length of x equal to its closest power of 2. Doing a performance benchmark on both the naive DFT and FFT implementation, we uncover that it is infact true that FFT outperforms naive DFT by several factors