Cooley–Tukey algorithm (Discrete Fourier Transform Discrete Fourier Transform)
Jump to navigation
Jump to search
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