Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem)

From Algorithm Wiki

Revision as of 10:24, 28 April 2023 by Admin (talk | contribs)

(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

2014

Reference

https://ieeexplore.ieee.org/document/6972008

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Ferreira,_Camargo,_Song_(1D_Maximum_Subarray_Maximum_Subarray_Problem)&oldid=47810"