Shamos (1D Maximum Subarray Maximum Subarray Problem)

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

Space Complexity

$O(\log n)$ words

(keep track of recursive maximums)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1978

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Shamos_(1D_Maximum_Subarray_Maximum_Subarray_Problem)&oldid=46950"