iterpc: Efficient Iterator for Permutations and Combinations

Iterator for generating permutations and combinations. They can be either drawn with or without replacement, or with distinct/ non-distinct items (multiset). The generated sequences are in lexicographical order (dictionary order). The algorithms to generate permutations and combinations are memory efficient. These iterative algorithms enable users to process all sequences without putting all results in the memory at the same time. The algorithms are written in C/C++ for faster performance. Note: 'iterpc' is no longer being maintained. Users are recommended to switch to 'arrangements'.

Package details

AuthorRandy Lai [aut, cre]
MaintainerRandy Lai <[email protected]>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the iterpc package in your browser

Any scripts or data that you put into this service are public.

iterpc documentation built on May 2, 2019, 2:12 p.m.