Add a note about empty subarray sum [closes #58]
This commit is contained in:
parent
085425e3b3
commit
c94cdf33f2
|
@ -401,6 +401,9 @@ the following subarray produces the maximum sum $10$:
|
||||||
\end{center}
|
\end{center}
|
||||||
\end{samepage}
|
\end{samepage}
|
||||||
|
|
||||||
|
We assume that an empty subarray is allowed,
|
||||||
|
so the maximum subarray sum is always at least $0$.
|
||||||
|
|
||||||
\subsubsection{Algorithm 1}
|
\subsubsection{Algorithm 1}
|
||||||
|
|
||||||
A straightforward way to solve the problem
|
A straightforward way to solve the problem
|
||||||
|
|
Loading…
Reference in New Issue