Timeline for Generating Subsets of a Multiset in Ascending Order of the Sums of the Elements of the Subset
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2018 at 18:38 | comment | added | Moni | @MaxAlekseyev Yes...but want to generate them in the ascending order so that if for many cases the answer (for which this has to generated) might come in the first quarters of numbers we may not need to generate all other 75% combinations. | |
| Nov 17, 2018 at 19:09 | comment | added | Max Alekseyev | @Moni: What is costly? You will need to generate all subsets anyway, and sorting will bring just a log() factor to that. | |
| Nov 15, 2018 at 19:23 | comment | added | Moni | That'd be extremely costly operation. | |
| Nov 15, 2018 at 12:28 | comment | added | Max Alekseyev | Generate all subsets and sort them by the elements sum value. | |
| Nov 15, 2018 at 7:09 | history | edited | Asaf Karagila♦ |
edited tags
|
|
| Nov 15, 2018 at 5:41 | comment | added | Gerry Myerson | Seems more like a programming question than a math question. | |
| Nov 15, 2018 at 5:05 | review | First posts | |||
| Nov 15, 2018 at 7:06 | |||||
| Nov 15, 2018 at 5:04 | history | asked | Moni | CC BY-SA 4.0 |