Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O({1})$ words
(Derived: You only need a constant number of variables that are of $O(1)$ size at any given time)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1965
Reference
-