Timeline for answer to Algorithm to return all combinations of k elements from n by Wormbo
Current License: CC BY-SA 3.0
Post Revisions
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2019 at 11:11 | comment | added | Christoph | The task is to generate all combinations that satisfy n over k. Binomial coefficients answer the question about how many ways there are choosing an unordered subset of k elements from a fixed set of n elements. Therefore the proposed algorithm does what it should. | |
| Nov 16, 2016 at 16:43 | comment | added | Dmitri Nesteruk |
This preserves the ordering. I'm expecting the result set to also contain c b a which it does not.
|
|
| S May 13, 2015 at 21:20 | history | answered | Wormbo | CC BY-SA 3.0 | |
| S May 13, 2015 at 21:20 | history | made wiki | Post Made Community Wiki by Wormbo |