mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
Update numerical_methods/fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
parent
20274510c4
commit
7cccbd3d87
@ -1,7 +1,7 @@
|
|||||||
/**
|
/**
|
||||||
* @file
|
* @file
|
||||||
* @brief [A fast Fourier transform
|
* @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
|
is an algorithm that computes the
|
||||||
* discrete Fourier transform (DFT) of a sequence , or its inverse (IDFT) , this
|
* discrete Fourier transform (DFT) of a sequence , or its inverse (IDFT) , this
|
||||||
algorithm
|
algorithm
|
||||||
|
Loading…
Reference in New Issue
Block a user