Hi all,
I wanted an application to write out all combinations given a set n, and subset k, otherwise written as choose(n,k). We all know that the number of combinations is n!/ (k!.(n-k)!) of course.
David Erez took up the challenge and wote his.
here is mine, just plain, simple and fast!
I deliberately held it simple to let everyone see how the structure is set up.
I used it to write out every possible combination in 7-card poker (133784560!)
Modify at will.......
Marc
PS: I use the prefix $ to get all the applications I am working on at the top of my folder for fast picking.
I wanted an application to write out all combinations given a set n, and subset k, otherwise written as choose(n,k). We all know that the number of combinations is n!/ (k!.(n-k)!) of course.
David Erez took up the challenge and wote his.
here is mine, just plain, simple and fast!
I deliberately held it simple to let everyone see how the structure is set up.
I used it to write out every possible combination in 7-card poker (133784560!)
Modify at will.......
Marc
PS: I use the prefix $ to get all the applications I am working on at the top of my folder for fast picking.
Attachments
Last edited: