Timeline for Generate all square sub-matrices of a given size
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2018 at 15:15 | comment | added | Erik the Outgolfer |
@Adám I would, but that's not how I do test suites at all. I'm still golfing this answer BTW. DUH (∪2,⍳4) is the same length as 2 1 3 4 >_> OK looks like there's nothing left to golf.
|
|
| Feb 9, 2018 at 15:12 | comment | added | Adám | Feel free to copy the test suite from my submission. | |
| Feb 9, 2018 at 15:07 | history | undeleted | Erik the Outgolfer | ||
| Feb 9, 2018 at 15:07 | history | edited | Erik the Outgolfer | CC BY-SA 3.0 |
added 60 characters in body
|
| Feb 9, 2018 at 15:04 | history | deleted | Erik the Outgolfer | via Vote | |
| Feb 9, 2018 at 15:04 | comment | added | Erik the Outgolfer | @Adám Uh, although I think this answer is in fact invalid :-( EDIT: Fixed, but now it's 31 bytes long... | |
| Feb 9, 2018 at 15:01 | comment | added | Adám |
Very clever. If you can successfully use dyadic ⍉ for non-trivial cases, then you have truly mastered array programming.
|
|
| Feb 9, 2018 at 13:46 | comment | added | Erik the Outgolfer | @Emigna Yeah, if I have time by then. | |
| Feb 9, 2018 at 13:45 | comment | added | Emigna | Do you intend to provide an explanation (after you've finished golfing of course)? I'd be interested to see how it works (and I don't know APL at all) :) | |
| Feb 9, 2018 at 13:42 | history | answered | Erik the Outgolfer | CC BY-SA 3.0 |