Content deleted Content added
Notability |
Added a section stating that the initialization of s is possibly erroneous |
||
Line 1:
== Possibly Erroneous Initialization of s ==
In the O(n) algorithm, s (the largest calculated sum so far) is initialized as follows:
<source lang="cpp">
int s=1<<31;
</source>
First, this assumes that each integer is exactly 4 bytes wide, which is not the case for all architectures.
Second, it seems sufficient to initialize it to the first element of the array, A[0]
[[User:Debajit|Debajit]] ([[User talk:Debajit|talk]]) 23:29, 25 November 2007 (UTC)
==Notability==
I have seen a few publications in IEEE and JSTOR refering to this algorithm. I have no understanding of the algorithm itself, therefore I cannot verify the accuracy of the information here, but I would conclude that this article is based on a notable topic. --[[User:MattWatt|MattWatt]] 22:07, 10 April 2007 (UTC)
| |||