Smith (2-dimensional Maximum subarray problem)

From Algorithm Wiki

Revision as of 09:56, 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^{3})$

Space Complexity

$O(log n)$ auxiliary? words

(divide-and-conquer)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://www.sciencedirect.com/science/article/pii/0167642387900347

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Smith_(2-dimensional_Maximum_subarray_problem)&oldid=47572"