Faster Brute Force (via x(L:U) = x(L:U-1)+x(U)) (1D Maximum Subarray Maximum Subarray Problem)

Time Complexity

$O(n^{2})$

Space Complexity

$O({1})$ words

(keep track of which subarray is being computed, along with current maximum)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1977

Reference

https://dl.acm.org/doi/pdf/10.1145/358234.381162