« first day (1547 days earlier)      last day (10 days later) » 

12:49 AM
is there an easy way to split a list into two parts like this: [a,b,c,d,e,f] -> [[a,c,e],[b,d,f]]?
I've come up with TC2 but that's pretty bad
 
 
1 hour later…
2:00 AM
@rak1507 builtin: ½
 
doesn't do what I want
 
oh, you want every other element
 
yea
 
TC2 is the shortest
 
well that's sad
 
2:03 AM
there are a lot of sad things in husk
but i think the lack of builtin makes for a lot more interesting golf experience
 
maybe
I was trying that collatz challenge but didn't get very far with it
for some reason nothing seemed to work I think I'm just tired or something
 
@rak1507 that is probably because sorting an infinite list never ends
!¡oOm?o→*3½%2N
 
no, I used merge, to sort two sorted lists into one
 
interesting
prolly still time out
try taking n elements from the array
 
@Razetime is this a solution?
oh it uses O
 
2:09 AM
i doubt it, times out
Just wrote it now
 
 
2 hours later…
Leo
3:48 AM
@rak1507 I was also trying to use that, the problem with TC2 is that it doesn't work well with an infinite list... When you try to transpose you can build the first two lines easily, but then you have to check all elements of the original list to see if any of them have more than two elements (and so you need a third line), so the computation never terminates
 
Leo
4:35 AM
@rak1507 That was a great idea! codegolf.stackexchange.com/a/224950/62393
 
 
16 hours later…
8:58 PM
@Leo ahh got it, that's annoying
nice answer
 

« first day (1547 days earlier)      last day (10 days later) »