Brute force (2-dimensional Maximum subarray problem)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{6})$ == 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 RAM == Year == 1977 == Reference == -")
Time Complexity
$O(n^{6})$
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 RAM
Year
1977
Reference
-