Skip to content
This repository has been archived by the owner on May 31, 2022. It is now read-only.
/ multichoose Public archive

Python code for listing all combinations of n multichoose k

License

Notifications You must be signed in to change notification settings

myyim/multichoose

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 

Repository files navigation

multichoose

Multichoose is a way to choose items, where n is the number of items to choose from and k is the sets of items to choose. Order is not important, and repeats are allowed.

For example, 4 multichoose 2 is the number of possible ways to choose a set of 2 items from a group of 4 different items. The solution is 10 and the combinations are {1,1}, {1,2}, {1,3}, {1,4}, {2,2}, {2,3}, {2,4}, {3,3}, {3,4} and {4,4}.

Python code for listing all combinations of n multichoose k and returns the list of all possible combinations (multisets).

License

This project is licensed under the MIT License.

About

Python code for listing all combinations of n multichoose k

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages