Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n)$? words (Computes and keeps track of DFTs for recursive subcases) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1965 == Reference == https://www.ams.org/journals/mcom/1965-19-090/S0025-5718-1965-0178586-1/S0025-5718-1965-0178586-1.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 10:30, 28 April 2023
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$? words
(Computes and keeps track of DFTs for recursive subcases)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1965