Perumalla and Deo (1D Maximum Subarray Maximum Subarray Problem)
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