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

Alex A.
Alex A.
12:18 AM
In the case of a full program, yes.
 
 
17 hours later…
Dennis
Dennis
4:55 PM
Is there an easy way to give the permalink's output a more pleasant format? display shows ellipses because the array is too large.
1
A: The Back-and-Forth Sequence

DennisJulia 0.4, 44 bytes f(x,k=endof(x)+1)=(try k=2find(x)[k/2]end;k) This function accepts a single integer in form of the list of its binary digits as input. The algorithm is equivalent to the one from @Agawa001's answer and my Jelly answer. Try it online! How it works find(x) returns the 1-b...

 
Alex A.
Alex A.
:D
? I see no ellipses
 
Dennis
Dennis
Because I used show. That's unaligned and ugly though.
Pretty, but incomplete.
 
Alex A.
Alex A.
Dang, the unexported Base.print_matrix(STDOUT, <array>) usually works but I think it falls back to the ellipses printing when the matrix is really big.
When in doubt, find an unexported Base function in the source code :P
 
Dennis
Dennis
Wonderful. Thanks!
 
Alex A.
Alex A.
My pleasure!
 
 
1 hour later…
Dennis
Dennis
6:12 PM
@AlexA. f(A,n)=n<1?eye(A):[A[i,:][:]⋅f(A,n-1)[:,j]for i=m=1:size(A,1),j=m] should work for matrix power.
Fifth power is slow as hell though. 97 seconds on my machine.
 
Alex A.
Alex A.
Why is the [:] necessary?
97 seconds?!
Will that even work on TIO?
 
Dennis
Dennis
Because it's not a vector, but a row array. ⋅ is picky that way.
 
Alex A.
Alex A.
Oh right.
 
Dennis
Dennis
No, it won't work on TIO. It's slow because f(A,n-1) is called m² times.
 
Alex A.
Alex A.
D:
Good god
 
Dennis
Dennis
6:15 PM
Regular funcrions are usually memoized. I wonder why that doesn't happen here...
 
Alex A.
Alex A.
:P
Yeah idk
Posted. Thanks!
 

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