Timeline for Generating Permutations in Python
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2017 at 19:50 | history | edited | Ludisposed | CC BY-SA 3.0 |
added 13 characters in body
|
| Sep 22, 2017 at 19:26 | history | edited | Ludisposed | CC BY-SA 3.0 |
added 173 characters in body
|
| Sep 22, 2017 at 19:18 | history | edited | Ludisposed | CC BY-SA 3.0 |
added 173 characters in body
|
| Sep 22, 2017 at 16:50 | comment | added | user2357112 |
Your second point is wrong. a[k + 1::-1] doesn't do what you think it does; it starts from a[k+1] and goes back towards a[0], rather than reversing a[k+1:].
|
|
| Sep 22, 2017 at 8:12 | vote | accept | Nils | ||
| Sep 22, 2017 at 8:07 | history | answered | Ludisposed | CC BY-SA 3.0 |