Algorithm 466 Four Combinatorial Algorithms [G6].

The article discusses four combinatorial algorithms. The different algorithms, by successive calls, produce a sequence of all combinatorial configurations belonging to the appropriate type, such as PERMU for permutations, COMBI for combinations of natural numbers, COMPOMIN for the composition of an integer, and COMPOMAX, which is the same as COMPOMIN but with maximum for each term. The four algorithms uses a single operation for producing a new configuration from the old one, in which PERMU is transformed by a single transposition of two adjacent elements, COMBI by replacing a single element x by a y, and COMPOMIN by changing the values of two adjacent terms.