Maximum subarray problem: Difference between revisions

Revision as of 04:58, 31 October 2007

Revision as of 05:19, 18 November 2007

Line 1:

{{Wikify|date=June 2007}}

{{Importance|date=April 2007}}

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

Line 62 ⟶ 59:

== External links ==

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

* [http://www.algorithmist.com/index.php/Kadane's_Algorithm www.algorithmist.com]

* [http://alexeigor.wikidot.com/kadane alexeigor.wikidot.com]

[[Category:Algorithms]]