Combination Sum I I Algorithm

In convex geometry, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points in an affine space) where all coefficients are non-negative and sum to 1. More formally, given a finite number of points there exist subsets of a vector space that are not closed under linear combinations but are closed under convex combinations.

Combination Sum I I source code, pseudocode and analysis