Package org.drip.graph.subarray

Sub-set Sum, k-Sum, and Maximum Sub-array Problems

Author:

Lakshmi Krishnamurthy

Class Summary

Class	Description
HorowitzSahni	HorowitzSahni implements the Sub-set Sum Check using the Horowitz-Sahni Scheme.
Kadane	Kadane implements the Kadane Algorithm for the Maximum Sub-array Problem.
PolynomialTimeApproximate	PolynomialTimeApproximate implements the Approximate Sub-set Sum Check using a Polynomial Time Scheme.
PseudoPolynomialDP	PseudoPolynomialDP implements the Sub-set Sum Check using a Pseudo-Polynomial Time Dynamic Programming Scheme.
SubsetSum	SubsetSum finds out is there is a non-empty Subset in the specified Array that adds up to the Specified Target.
ThreeSum	ThreeSum exposes the Check that indicates if the Set of Numbers contains 3 that Sum to Zero.
ThreeSumQuadraticComparator	ThreeSumQuadraticComparator implements the Check that indicates if the Set of Numbers contains 3 that Sum to Zero using a Binary Search Comparator, leading to a Quadratic Time Algorithm.
ThreeSumQuadraticHash	ThreeSumQuadraticHash implements the Check that indicates if the Set of Numbers contains 3 that Sum to Zero using a Hash-table, leading to a Quadratic Time Algorithm.
ThreeSumVariantBuilder	ThreeSumVariantBuilder converts the specified 3SUM Variant into a Standard 3SUM Problem.