Bird (1D Maximum Subarray Maximum Subarray Problem)
Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ auxiliary ??? (keep track of current tail sum and best sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == ??? == Year == 1989 == Reference == https://dl.acm.org/doi/10.1093/comjnl/32.2.122")
Time Complexity
$O(n)$
Space Complexity
$O({1})$ auxiliary ???
(keep track of current tail sum and best sum)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
???
Year
1989