Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^3: Permutation of groups

by tomazos (Deacon)
on Nov 20, 2006 at 20:16 UTC ( [id://585133]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Permutation of groups
in thread Permutation of groups

Specifically for a given partitioning ever person must belong to exactly one team.

Teams do not have to be of the same size. 

eg For three people:
1.    A   B  C
2.    AB  C
3.    A   BC
4.    AC  B
5.    ABC

[download]

Replies are listed 'Best First'.
Re^4: Permutation of groups
by Limbic~Region (Chancellor) on Nov 20, 2006 at 20:50 UTC
    tomazos,
    Assuming it does the right thing, you are going to want to use the integer partitioning code blokhead refers to above and the binary counting I explained. You will not have a contigous range of team reference numbers but they will be guaranteed to be unique and will never be higher than 2 ** $num_of_people.

    If I find the time tonight or tomorrow, I will code this for you. If you end up coding it on your own, please post so others can benefit and I won't bother.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://585133]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2025-07-16 11:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found
    Notices?
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.