Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O({1})$ auxiliary words (keep track of which subarray is being computed, along with current maximum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == https://dl.acm.org/doi/pdf/10.1145/358234.381162") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O({1})$ | $O({1})$ words | ||
(keep track of which subarray is being computed, along with current maximum) | (keep track of which subarray is being computed, along with current maximum) | ||
Latest revision as of 08:54, 10 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O({1})$ words
(keep track of which subarray is being computed, along with current maximum)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1977