Iterator for generating permutations and combinations. They can be either drawn with or without replacement, or with distinct/ nondistinct 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 


Author  Randy Lai [aut, cre] 
Date of publication  20180424 05:12:23 UTC 
Maintainer  Randy Lai <[email protected]> 
License  GPL2 
Version  0.4.0 
URL  https://randy3k.github.io/iterpc 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.