Ferreira, Camargo, Song (1D Maximum Subarray Maximum Subarray Problem): Difference between revisions
Jump to navigation
Jump to search
(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 == 2014 == Reference == https://ieeexplore.ieee.org/document/6972008") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(log n)$ | $O(\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 10:24, 28 April 2023
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