Anonymous user
Talk:Greatest subsequential sum: Difference between revisions
→<i>subarray</i> is a somewhat unclear term: Fixed indentation on old comment.
(→<i>subarray</i> is a somewhat unclear term: Fixed indentation on old comment.) |
|||
Line 11:
: Possibly renaming the article from "Maximum subarray" to "Maximum subsequence" would be a good idea (after all, the interesting part here is the algorithm, not the actual data structure used to store it; e.g. in Lisp, one might prefer to use lists rather than arrays). Or even better, rename it to something like "Subsequence with maximal element sum" (surely a better new title can be found along this line). --[[User:Ce|Ce]] 20:45, 4 August 2007 (EDT)
:: I agree that "Maximum subsequence" would make a better title, and that specification in terms of subarrays suggests that summing across portions of higher-dimensional arrays should be included. [[User:TBH|TBH]] 04:24, 24 December 2007
== Erroneous Examples ==
Many of the examples initialize the maximum subarray sum to 0. This produces erroneous results if the maximum subarray total is negative. The maximum subarray should be initialized to the most negative integer value available for each language.--[[User:Waldorf|Waldorf]] 16:37, 29 December 2007 (MST)
| |||