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

fix : added time complexity in documentation

Browse Source
This commit is contained in:
Ameya Chawla
2021-10-21 00:46:37 +05:30
committed by GitHub
parent f64ed1f1a2
commit 800730ab61
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
numerical_methods/fast_fourier_transform.cpp
View File

@@ -10,6 +10,8 @@
* in short period time by just using the coefficents 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).
* @details
* https://medium.com/@aiswaryamathur/understanding-fast-fourier-transform-from-scratch-to
-solve-polynomial-multiplication-8018d511162f