Naive algorithm (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Naive_algorithm_(Discrete_Fourier_Transform_Discrete_Fourier_Transform)&oldid=45317"