Talk:Combinations with repetitions: Difference between revisions
(→Task definition: new section) |
(→Task definition: Not clear.) |
||
| Line 4: | Line 4: | ||
At this stage, it's very hard for me to work out exactly what is to be implemented; the task gives very little guidance over what a “k-combination with repetition” is exactly (it's not the clearest of wikipedia pages that is linked to). At the very least, I'd expect it to use a simple small example (with as few elements as possible) to show exactly what is meant and how things differ from a standard combination-enumerator; it could then ask for the generation of the combinations for a larger input set. –[[User:Dkf|Donal Fellows]] 23:31, 16 November 2010 (UTC) |
At this stage, it's very hard for me to work out exactly what is to be implemented; the task gives very little guidance over what a “k-combination with repetition” is exactly (it's not the clearest of wikipedia pages that is linked to). At the very least, I'd expect it to use a simple small example (with as few elements as possible) to show exactly what is meant and how things differ from a standard combination-enumerator; it could then ask for the generation of the combinations for a larger input set. –[[User:Dkf|Donal Fellows]] 23:31, 16 November 2010 (UTC) |
||
:Ditto on the lack of clarity. |
|||
:What would be the result of: |
|||
n=(1,2,3), k=2; |
|||
n=(1,1,2,3), k=2 |
|||
n=(1,1,1,2,3), k=2 |
|||
:And how do you compute the result in the general case? --[[User:Paddy3118|Paddy3118]] 00:01, 17 November 2010 (UTC) |
|||
Revision as of 00:01, 17 November 2010
Original implementations needed; the linked site does not indicate any license or copyright notice, which leads it to default (at least where Rosetta Code is based out of) to a default of "all rights reserved." The task can likely go to non-draft once it's slightly cleaned up, and original implementations are provided. --Michael Mol 19:39, 16 November 2010 (UTC)
Task definition
At this stage, it's very hard for me to work out exactly what is to be implemented; the task gives very little guidance over what a “k-combination with repetition” is exactly (it's not the clearest of wikipedia pages that is linked to). At the very least, I'd expect it to use a simple small example (with as few elements as possible) to show exactly what is meant and how things differ from a standard combination-enumerator; it could then ask for the generation of the combinations for a larger input set. –Donal Fellows 23:31, 16 November 2010 (UTC)
- Ditto on the lack of clarity.
- What would be the result of:
n=(1,2,3), k=2; n=(1,1,2,3), k=2 n=(1,1,1,2,3), k=2
- And how do you compute the result in the general case? --Paddy3118 00:01, 17 November 2010 (UTC)