Timeline for Is there a proof of the recursive algorithm for generating all permutations of a sequence?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 4, 2014 at 9:21 | comment | added | Raphael | Of course there is a proof. What have you tried and where did you get stuck? Are you familiar with induction? | |
| Dec 4, 2014 at 9:21 | history | edited | Raphael |
edited tags; edited tags
|
|
| Dec 4, 2014 at 0:48 | answer | added | yo' | timeline score: 1 | |
| Nov 28, 2013 at 10:43 | history | tweeted | twitter.com/#!/StackCompSci/status/406010439303430144 | ||
| Nov 28, 2013 at 2:19 | answer | added | Yuval Filmus | timeline score: 2 | |
| Nov 27, 2013 at 23:58 | comment | added | Patrick87 |
Recursive calls to permute only affect areas to the right of the most recently swapped symbol. If the original list doesn't contain duplicates, this cannot produce a duplicate ordering. If the original list does contain duplicates, this algorithm clearly generates them. If Python doesn't show the duplicates, it's because the code is not what you present.
|
|
| Nov 27, 2013 at 21:26 | history | asked | Dun Peal | CC BY-SA 3.0 |