Restricted Integer Composition

Generates restricted and unrestricted integer compositions

This is a Matlab implementation of a unique algorithm by J. D. Opdyke with very good properties for solving the Integer Composition problem of finding all permutations in the additive partitioning of integers. It also accepts lower and upper bounds for the number of sum terms as well as lower and upper parts for the sum term values. Quite useful for applications in combinatorics. The program is a direct implementation of the pseudo-code contained in the official publication in
J. Math. Modeling and Algorithms (2009) V9 N1, p.53 - 97
It is not necessarily matlab-optimized and it was not tested for very large numbers but seems to work pretty fast for integers up to 100.