ncompositions

Fast generators and iterators for permutations, combinations,
integer partitions and compositions. The arrangements are in
lexicographical order and generated iteratively in a memory efficient manner.
It has been demonstrated that 'arrangements' outperforms most existing
packages of similar kind. Benchmarks could be found at
<https://randy3k.github.io/arrangements/articles/benchmark.html>.

Randy Lai

arrangements

Fast Generators and Iterators for Permutations, Combinations,
Integer Partitions and Compositions

ncompositions function

<dl><dt>n</dt>
<dd>an non-negative integer to be partitioned</dd>
<dt>k</dt>
<dd>number of parts</dd>
<dt>bigz</dt>
<dd>an logical to use gmp::bigz</dd></dl>

Arguments

Number of compositions — ncompositions

<dl>

<dt>n</dt>
<dd>an non-negative integer to be partitioned</dd>


<dt>k</dt>
<dd>number of parts</dd>


<dt>bigz</dt>
<dd>an logical to use gmp::bigz</dd>

</dl>

ncompositions: Number of compositions

Description

Usage

Arguments

See Also

Examples