OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages 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-21 08:10:48 +05:30 committed by GitHub
parent 20274510c4
commit 7cccbd3d87
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
numerical_methods/fast_fourier_transform.cpp
View File

@ -1,7 +1,7 @@
/**
* @file
* @brief [A fast Fourier transform
(FFT)](https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f)
* (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