Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem)

From Algorithm Wiki
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(log n)$ == Space Complexity == $O(n)$ auxiliary words (constant number of arrays as outlined in algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == EREW PRAM == Year == 1995 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.1291&rep=rep1&type=pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(log n)$

Space Complexity

$O(n)$ auxiliary words

(constant number of arrays as outlined in algorithm)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

EREW PRAM

Year

1995

Reference

https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.1291&rep=rep1&type=pdf

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