Package org.drip.sample.subarray

Class MaximumSumSequence

java.lang.Object
org.drip.sample.subarray.MaximumSumSequence
public class MaximumSumSequence
extends java.lang.Object
MaximumSumSequence illustrates Kadane's Maximum Sequential Sub-array Sum Algorithm. The References are:

  • Bentley, J. (1984): Programming Pearls: Algorithm Design Techniques Communications of the ACM 27 (9) 865-873
  • Bentley, J. (1989): Programming Pearls nd Edition Addison-Wesley Reading MA
  • Gries, D. (1982): A Note on a Standard Strategy for developing Loop Invariants and Loops Science of Computer Programming 2 (3) 207-214
  • Takaoka, T. (2002): Efficient Algorithms for the Maximum Sub-array Problem by Distance Matrix Multiplication https://www.sciencedirect.com/science/article/pii/S1571066104003135?via%3Dihub
  • Wikipedia (2020): Maximum Sub-array Problem https://en.wikipedia.org/wiki/Maximum_subarray_problem




Author:
Lakshmi Krishnamurthy

  • Constructor Summary

    Constructors
    Constructor Description
    MaximumSumSequence()  

  • Method Summary

    Modifier and Type Method Description
    static void main​(java.lang.String[] argumentArray)
    Entry Point

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • MaximumSumSequence

      public MaximumSumSequence()

  • Method Details

    • main

      public static final void main​(java.lang.String[] argumentArray) throws java.lang.Exception
      Entry Point
      Parameters:
      argumentArray - Command Line Argument Array
      Throws:
      java.lang.Exception - Thrown on Error/Exception Situation