backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-11 14:36:25 +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-18 23:55:35 +05:30
committed by GitHub
parent 501fd26f22
commit a6594c85c0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
numerical_methods/fast_fourier_transform.cpp
View File

@@ -1,6 +1,6 @@
/** /**
* @file * @file
* @brief A fast Fourier transform (FFT) is an algorithm that computes the * @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 * 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 * 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. * in short period time by just using the coefficents of the polynomial function.