Content deleted Content added
No edit summary |
|||
Line 127:
print (max_so_far , start, end)
</code>
== Issues with the "History" section, regarding brute-force ==
It seems incorrect that "the brute force running time" of the one-dimensional problem is "''O''(''n''<sup>3</sup>)". This is not right.
Rather, the brute-force runtime is ''O''(''n''<sup>2</sup>). What, then, I wonder, did Ulf Grenander's improvement do? This is confusing.
I suspect that there are similar issues with the description of the two-dimensional problem's history.
I'm not clear on the history, or else I would edit this myself...!
| |||