FastCombPerm: A Fast Package For Creating Combinations and Permutations With And Without Repetition
Sometimes we need to find the list of all possible without spending time designing recursive or non-recursive algorithms to find permutations or combinations list. By using this software you can easily count and find the list of all items. We researched the algorithms for creating possible lists and finally implemented this software.
- Open-Source (Free)
- Under GPL-3 license
- Computing power sets
- Computing combinations with and without repetition
- Computing permutations with and without repetition
help - show this message
version - show version
exit - exit program
set ... ... ...
Power Set:
list power
save power
count power
Combinations:
list combinations with repeat <n>
save combinations with repeat <n>
count combinations with repeat <n>
list combinations without repeat <n>
save combinations without repeat <n>
count combinations without repeat <n>
Permutations:
list permutations with repeat <n>
save permutations with repeat <n>
count permutations with repeat <n>
list permutations without repeat <n>
save permutations without repeat <n>
count permutations without repeat <n>