Talk:Maximum subarray problem: Difference between revisions

Revision as of 18:45, 10 September 2023

Latest revision as of 14:05, 14 January 2025

(2 intermediate revisions by 2 users not shown)

Line 1:

{{WikiProject banner shell|class=|

{{WikiProject Computer science}}

}}

== Possibly Erroneous Initialization of s ==

Line 105 ⟶ 107:

here is a working script

<syntaxhighlight lang="text">

<code>

max_ending_here = A[0]

Line 126 ⟶ 128:

print (max_so_far , start, end)

</syntaxhighlight>

</code>

== Issues with the "History" section, regarding brute-force ==

Line 168 ⟶ 170:

:I'm skeptical that this will help but it seems harmless enough and worth a try. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 18:45, 10 September 2023 (UTC)

::{{done}}. Some complications were caused by the fact that both Bentley and Gries refer to the "empty" variant, while we start with the "nonempty" variant. The worst of them is the new [note6] which now has to explain a modification the Bentley should have made in the ''previous'' (rather than the ''current'') variant. - I gave the essential loop invariants for both algorithm variants; they could (after some days of trial and error) be verified by [[Frama-C]], so they shouldn't be flawed. - [[User:Jochen Burghardt|Jochen Burghardt]] ([[User talk:Jochen Burghardt|talk]]) 15:28, 13 September 2023 (UTC)