Description Usage Arguments Details Value Author(s) References See Also Examples
The APV class defines a pseudo-vector containing all
the arranged k-amalgams (permutations with replacement) of the objects stored
in items. The function apv is a constructor for this class.
1 | apv(k, items)
|
k |
the number of objects taken at a time. |
items |
a vector of objects to be amalgamated. |
The amalgams are arranged according to the order in which the objects
appear in items. The arrangement is very similar to that used by the PPV class
(see ppv) except that objects are replaced during permutation creation.
an instance of APV.
Richard Ambler
Steinhaus-Johnson-Trotter algorithm. (2014, April 29). In Wikipedia, The Free Encyclopedia. Retrieved 13:24, September 5, 2014
Permutations Pseudo-Vector ppv
Combinations Pseudo-Vector cpv
Selections Pseudo-Vector spv
Subsets Pseudo-Vector sspv
1 2 3 4 5 6 7 8 9 10 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.