Well-documented algorithms to find combinations and permutations (including partial, circular and superpermutations) of elements with/without repetition.
-
Updated
May 28, 2022 - C++
Well-documented algorithms to find combinations and permutations (including partial, circular and superpermutations) of elements with/without repetition.
Add a description, image, and links to the partial-permutations topic page so that developers can more easily learn about it.
To associate your repository with the partial-permutations topic, visit your repo's landing page and select "manage topics."