Feeds
已回答
Fibonacci sequence that fills an n*n matrix
for i=2:n for j=1:n; if j==1; h(i,j)=h(i-1,n)+h(i-1,n-1); else if j==2 h(i,j)=h...
Fibonacci sequence that fills an n*n matrix
for i=2:n for j=1:n; if j==1; h(i,j)=h(i-1,n)+h(i-1,n-1); else if j==2 h(i,j)=h...
3 years 前 | 0
