Timeline for Computing $n$th lexicographically smallest permutation of length up to $k$
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2016 at 13:38 | comment | added | Yuval Filmus | Unfortunately I am not aware of any online resources on this matter. | |
| Nov 18, 2016 at 13:36 | comment | added | user61633 | Talking about the harder version, I can't see a way other than keeping increment count and (somehow) generating strings on the fly as you go towards $k$. You don't even know how many strings there will be at all given how big $n$ can be. I don't want to take too much of your time, could you point me somewhere in the net for the detailed explanation of similar/exact problem? | |
| Nov 18, 2016 at 12:55 | comment | added | Yuval Filmus | Yes, but the enumeration problem will be slightly more difficult. | |
| Nov 18, 2016 at 12:54 | comment | added | user61633 | What if I'll say that no two consecutive elements can be the same, will the logic still apply? | |
| Nov 18, 2016 at 12:28 | history | answered | Yuval Filmus | CC BY-SA 3.0 |