Two-pass algorithm ( Variance Calculations): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary words (Maintain number of values, sum of values, and sum of squares of (value minus mean) terms) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1940 == Reference == -") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $O({1})$ words | ||
(Maintain number of values, sum of values, and sum of squares of (value minus mean) terms) | (Maintain number of values, sum of values, and sum of squares of (value minus mean) terms) | ||
Latest revision as of 09:42, 10 April 2023
Time Complexity
$O(n)$
Space Complexity
$O({1})$ words
(Maintain number of values, sum of values, and sum of squares of (value minus mean) terms)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1940
Reference
-