backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-08 15:14:01 +08:00
Code Issues Projects Releases Wiki Activity

Update numerical_methods/fast_fourier_transform.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Ameya Chawla
2021-10-26 01:04:36 +05:30
committed by GitHub
parent 276a4afb95
commit d60ee17812
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
numerical_methods/fast_fourier_transform.cpp
View File

@@ -2,13 +2,13 @@
* @file
* @brief [A fast Fourier transform
* (FFT)](https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f)
is an algorithm that computes the
* discrete Fourier transform (DFT) of a sequence , or its inverse (IDFT) , this
algorithm
* is an algorithm that computes the
* discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT), this
* algorithm
* has application in use case scenario where a user wants to find points of a
function
* in short period time by just using the coefficents of the polynomial
function.
* function
* in a short time by just using the coefficients of the polynomial
* function.
* It can be also used to find inverse fourier transform by just switching the value of omega.
* @time complexity
* this algorithm computes the DFT in O(nlogn) time in comparison to traditional O(n^2).