commend Revolving Door algorithm to find C(7,3), which is covered at
> Knuth's TAOCP pre-fascicle 3a. There are also other combinatorial algorithms
> in that fascicle.
>
> HTH,
>
> coskun...
>
> On Sun, Sep 14, 2008 at 8:31 AM, Noam Wolf <[EMAIL PROTECTED]> wrote:
>
&g
Let's say I have 7 students and I would like to find out how many
different ways I can arrange them in two groups, one of size 3 and one
of size 4. The answer is simple, using binomial coefficient we can
compute:
7 choose 4 = (7 / 4) = 35
and
7 choose 3 = (7 / 3) = 35
Now, I would like to print
