Revision as of 21:25, 7 January 2018 edit Poitevinpm (talk \| contribs) 25 edits No edit summary ← Previous edit		Revision as of 21:26, 7 January 2018 edit undo SineBot (talk \| contribs) Bots 2,564,948 edits m Signing comment by Poitevinpm - "" Next edit →
Line 83: The divide and conquer version of the maximum subarray is notoriously O(n lg n) (see CLRM for instance as a reference.) I have trouble understanding the solution, for instance, what sum[f - 1] and sum[f]? the only array defined clearly in the problem is a, I don't know what sum is supposed to contain. An additional explanation would be great. <!-- Template:Unsigned --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Poitevinpm\|Poitevinpm]] ([[User talk:Poitevinpm#top\|talk]] • [[Special:Contributions/Poitevinpm\|contribs]]) 21:25, 7 January 2018 (UTC)</small> <!--Autosigned by SineBot-->

Talk:Maximum subarray problem: Difference between revisions