Shamos (1D Maximum Subarray Maximum Subarray Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(\log n)$ words
(keep track of recursive maximums)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1978
Reference
-