Maximum subarray problem: Difference between revisions

Revision as of 10:47, 11 April 2007

Revision as of 00:23, 6 June 2007

Line 1:

{{Wikify|June 2007}}

{{Importance|date=April 2007}}

'''Kandane's Algorithm''' finds the Sub-[[Array]] of any size with Maximum sum.

for example of Array is like

Line 58 ⟶ 60:

</pre>

== LINKExternal links ==

[http://computationalthinking.googlepages.com/kadanealgorithm Kandane's Algorithm]

{{Uncategorized|June 2007}}