Thanks Coskun,
Yeah that helped! I was able to print all options quite easily once I
implemented the RD algorithm. Basically I found all combinations of
C(7, 3) then for each of those combinations I simply added the "other"
4 values.
Here's the output...
Total combinations: 35
1. [a, b, c] -->
Hi,
try to see the problem in a different way; choosing 3 students from a group
of 7. This is a simpler point of view. Then let the other 4 students make
another group of size 4.
I recommend Revolving Door algorithm to find C(7,3), which is covered at
Knuth's TAOCP pre-fascicle 3a. There are also
