Two-pass algorithm ( Variance Calculations)

From Algorithm Wiki

Revision as of 08:42, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Two-pass_algorithm_(_Variance_Calculations)&oldid=47400"