Timeline for Generate the set of prepend-append permutations in lexicographically sorted order
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot | replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/ | |
| Mar 6, 2015 at 16:27 | comment | added | FryAmTheEggman | OK, I wanted to try to beat CJam before posting but I guess the zip trick is interesting enough to merit posting it. Good luck with Pyth ;) | |
| Mar 6, 2015 at 16:05 | comment | added | PurkkaKoodari | @FryAmTheEggman You might actually want to add that as your own answer. That's just awesome. | |
| Mar 6, 2015 at 16:03 | comment | added | FryAmTheEggman | I came up with a way to save several bytes by manually doing the second map over [1,-1]. I can save bytes to hardcode something that short, especially when you simplify the logic. I get L?]]1<b2sCm,+db+bdytb | |
| Mar 6, 2015 at 15:56 | history | edited | PurkkaKoodari | CC BY-SA 3.0 | added 131 characters in body |
| Mar 6, 2015 at 15:18 | comment | added | FryAmTheEggman | Some pyth stuff: -b1 can be tb, [1_1) can be ,1_1 (however you can just drop the close bracket as you only need to count the bytes needed to make the function, even though you won't be able to call it without closing it), and you don't need to wrap b in a list as pyth automatically converts to list when adding a list to an int. | |
| Mar 6, 2015 at 10:30 | history | edited | PurkkaKoodari | CC BY-SA 3.0 | explanation, some golding |
| Mar 6, 2015 at 10:24 | history | answered | PurkkaKoodari | CC BY-SA 3.0 |