Description Usage Arguments Details Value Author(s) References See Also Examples
The CPV
class defines a pseudo-vector containing all
the arranged k
-combinations of the objects stored
in items
. The function cpv
is a constructor for this class.
1 | cpv(k, items)
|
k |
the number of objects taken at a time. |
items |
a vector of objects to be combined. |
The combinations are arranged according to the order in which the objects
appear in items
. Combinations containing the first object in
items
are followed by combinations that contain the second object
but not the first, which are followed by combinations that contain the third
but neither the first or the second, etc.
an instance of CPV
.
Richard Ambler
Steinhaus-Johnson-Trotter algorithm. (2014, April 29). In Wikipedia, The Free Encyclopedia. Retrieved 13:24, September 5, 2014
Permutations Pseudo-Vector ppv
Amalgams Pseudo-Vector apv
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.