*segfaults your language*

*segfaults your language*

nothing personnel, kid.

Attached: ack.png (498x138, 20K)

Other urls found in this thread:

youtube.com/watch?v=i7sm9dzFtEI
twitter.com/NSFWRedditImage

learn some real math, i mean, fluid mechanics, kiddo

what exactly does this calculate?

Some conditional fibonacci stuff? No idea

nothing of significance, really. used to test how compilers optimize recursion.

ok i can see how it gets messy. How does a compiler optimize so it doesnt segfault?

What are m and n?

retardese translation: replace the left hand side with A(m, n).

>thinks he needs recursion

This notation is very bad btw. The M and N should be small, unless
you are referring to the last element of the matrix, which you clearly are not. So OP is retarded. I'm assuming its actually meant to be A(m,n), and M,N as the size of the matrix.
In math indexing usually begins at 1 for matrices, but this will not work here since m can be 0, which makes the M,N notation even more retarded, so we use 0-index notation instead.
Let M,N=3, meaning it's a 3x3 matrix.
A(0, 0) = 1 #n+1
A(0, 1) = 2 #n+1
A(0, 2) = 3 #n+1
A(1, 0) = A(0, 1) = 2 #m>0 n=0
A(1, 1) = A(0, A(1, 0)) = A(0, 2) = 3 #m>0, n>0
A(1, 2) = A(0, A(1, 1)) = A(0, 3) = 4 #m>0, n>0 !segfault!
A(2, 0) = A(1, 1) = 3 #m>0 n=0
A(2, 1) = A(1, A(2, 0)) = A(1, 3) = A(0, A(1, 2)) = A(0, 4) = 5 #m>0, n>0 !segfault!
A(2, 2) = A(1, A(2, 1)) = A(1, 5) = A(0, A(1, 4)) = A(0, A(.... #etc more segfault

even more retarded than OP