- Implemented FFT using divide and conquer approach in O(N*log(N)) Time Complexity
- FFT Transforms the Coefficient matrix to Sample space( Points)
- IFFT Transforms the Sample space to Coefficient Matrix
All this is implemented in O(nlogn) Hence, Multiply is O(n*logn)