arrangements

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.

Last 30 days

This package has been downloaded 3,741 times in the last 30 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 91 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 53,477 times in the last 365 days. This work is reaching a lot of screens. A significant achievement indeed! The day with the most downloads was Oct 06, 2024 with 458 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.