A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the

this folder contains the code for inverse fast fourier transform and the inverse dft. hope it helps. along with it it has several problem statements