Brute Force (1D Maximum Subarray Maximum Subarray Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
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
Reference
-