Talk:Maximum subarray problem: Difference between revisions

Content deleted Content added
Undid revision 885227133 by Roadguy2 (talk) whoops
No edit summary
Line 65:
<s>Applying the algorithm as shown in the page, I get a maximum subarray of 11, whereas the maximum subarray should be 13 (3 + 10)</s> <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/187.194.146.244|187.194.146.244]] ([[User talk:187.194.146.244|talk]]) 17:31, 16 November 2013 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
(Scratch previous comment, the algorithm is correct)
 
The solution given in python is incorrect. Please remove the code.
 
it fails following case: [-2,1,-3,4,-1,2,1,-5,4]. Should produce 6, instead of 10.
 
 
== Clarification of maximum sum when maximum sum is < 0. ==