Nothing
arrangements: Fast Generators and Iterators for Permutations, Combinations, Integer Partitions and Compositions
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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Randy Lai [aut, cre] |
| Maintainer | Randy Lai <randy.cs.lai@gmail.com> |
| License | MIT + file LICENSE |
| Version | 1.1.9 |
| URL | https://github.com/randy3k/arrangements |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the arrangements package in your browser
Any scripts or data that you put into this service are public.
