Smith (2-dimensional Maximum subarray problem)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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.ezproxy.canberra.edu.au/science/article/pii/0167642387900347")

(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.ezproxy.canberra.edu.au/science/article/pii/0167642387900347

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