Grenander (1D Maximum Subarray Maximum Subarray Problem)

From Algorithm Wiki

Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (storing precomputed cumulative sums) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == -")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ words

(storing precomputed cumulative sums)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1977

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Grenander_(1D_Maximum_Subarray_Maximum_Subarray_Problem)&oldid=44472"