Shamos (1D Maximum Subarray Maximum Subarray Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(log n)$ auxiliary words (keep track of recursive maximums) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1978 == Reference == -") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(log n)$ | $O(\log n)$ words | ||
(keep track of recursive maximums) | (keep track of recursive maximums) | ||
Latest revision as of 07:54, 10 April 2023
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
-