# Gries (1D Maximum Subarray Maximum Subarray Problem)

Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == https://www.sciencedirect.com/science/article/pii/0167642383900151?via%3Dihub")

## 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

https://www.sciencedirect.com/science/article/pii/0167642383900151?via%3Dihub