Timeline for What is the fastest algorithm of generating all possible permutations (within a given set of constraints) of a multidimensional array?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2019 at 8:02 | vote | accept | layer19 | ||
| Feb 6, 2019 at 3:11 | comment | added | Yuval Filmus | Different fillings won’t produce the same permutations, since they have different histograms. | |
| Feb 5, 2019 at 21:16 | comment | added | layer19 | @YuvalFilmus "First generate..." -- Do I understand correctly that the best way to go over all permutations of a multidimensional array is to map it into 1d-array with index math and then go over all permutations of that array with lexicographical sorting method? This way we'll have S! permutations for each filling. And we need to go over all fillings also. But shouldn't different fillings produce the same permutations sometimes as the elements may duplicate? Is there a way to take it into consideration? | |
| Feb 5, 2019 at 16:31 | comment | added | user16034 | What do you call a permutation of a multidimensional array ?? | |
| Feb 5, 2019 at 15:41 | answer | added | Yuval Filmus | timeline score: 0 | |
| Feb 5, 2019 at 15:33 | comment | added | Yuval Filmus | I'm not sure how "input from keyboard" makes any difference. | |
| Feb 5, 2019 at 10:24 | comment | added | Yuval Filmus | First generate all possible ways to fill your array in nondecreasing order in such a way that all symbols occur; it is standard to count and enumerate all such ways. Then go over all permutations of each - another standard task. | |
| Feb 5, 2019 at 10:20 | history | edited | layer19 | CC BY-SA 4.0 |
added 4 characters in body; edited title
|
| Feb 4, 2019 at 10:44 | history | edited | layer19 | CC BY-SA 4.0 |
added 2 characters in body
|
| Feb 4, 2019 at 10:34 | history | edited | layer19 | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Feb 4, 2019 at 10:15 | review | First posts | |||
| Feb 4, 2019 at 10:40 | |||||
| Feb 4, 2019 at 10:13 | history | asked | layer19 | CC BY-SA 4.0 |