Timeline for Decompose binary into alternating subsequences
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Aug 11, 2017 at 10:40 | history | edited | Adám | CC BY-SA 3.0 |
explanation and +4 for fix
|
| May 26, 2016 at 13:17 | history | edited | Adám | CC BY-SA 3.0 |
added 23 characters in body
|
| Mar 14, 2016 at 12:03 | comment | added | Adám |
@Dennis Be aware of the two versions of R←X⊂Y: With ⎕ML<3 (i.e. Dyalog style), a new partition is started in the result corresponding to each 1 in X up to the position before the next 1 in X (or the last element of X) become the successive items of R. With ⎕ML=3 (i.e. IBM style), a new partition is started in the result whenever the corresponding element in X is greater than the previous one. Items in Y corresponding to 0s in X are not included in the result. So ⎕ML←1 ⋄ 1 0 0 1 0 1 1 ⊂ ⍳7 is equivalent to ⎕ML←3 ⋄ 4 3 2 4 4 5 7 ⊂ ⍳7`
|
|
| Mar 11, 2016 at 18:36 | comment | added | Dennis |
⊂ is really useful here. I should add that to Jelly.
|
|
| Mar 11, 2016 at 15:11 | review | Low quality posts | |||
| Mar 11, 2016 at 15:30 | |||||
| Mar 11, 2016 at 14:53 | history | answered | Adám | CC BY-SA 3.0 |