Package org.drip.sample.subarray

Sub-set and Sub-array Sums/Matches

Author:

Lakshmi Krishnamurthy

Class Summary

Class	Description
DistinctArrayThreeSum	DistinctArrayThreeSum illustrates the Check that indicates if the Set of Numbers contains 3 that Sum to Zero over 3 Distinct Input Arrays.
HorowitzSahniSubsetSum	HorowitzSahniSubsetSum illustrates the Sub-set Sum Check using the Horowitz-Sahni Scheme.
MaximumSumSequence	MaximumSumSequence illustrates Kadane's Maximum Sequential Sub-array Sum Algorithm.
PolynomialTimeApproximateSubsetSum	PolynomialTimeApproximateSubsetSum illustrates the Approximate Sub-set Sum Check using a Polynomial Time Scheme.
PseudoPolynomialSubsetSum	PseudoPolynomialSubsetSum illustrates the Dynamic Programming Based Maximum Sequential Sub-array Sum Algorithm.
QuadraticThreeSum	QuadraticThreeSum implements the Check that indicates if the Set of Numbers contains 3 that Sum to Zero using Quadratic Time Schemes.