Kadane's Algorithm (1D Maximum Subarray Maximum Subarray Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$ auxiliary words
(keep track of current tail sum and best sum)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1982
Reference
-