tts algoritma

1. for i= 1 to 5
input A(i)
next;
for p= 1 to 5
printf A(p)
netx p

jwb
A (i) A (p)
A(1) 3 A(1) 3
A(2) 5 A(2) 5
A(3) 7 A3) 7
A(4) 8 A(4) 8
A(5) 2 A(5) 2


2. for a= 1 to 5
for b=1 to 5
input i (a,b)
next b
next a
for a= 1 to 5
for b= 2 to 5
print i (a,b-1)
next b
next a

jwb

i (a,b)
i (1,1) A i (2,1) F i (3,1) K i (4,1) P i (5,1) U
i (1,2) B i (2,2) G i (3,2) L i (4,2) Q i (5,2) V
i (1,3) C i (2,3) H i (3,3) M i (4,3) R i (5,3) W
i (1,4) D i (2,4) I i (3,4) N i (4,4) S i (5,4) X
i (1,5) E i (2,5) J i ( 3,5) O i (4,5) T i (5,5) Y


i (a,b-1)
i(1,1) A i(2,1) F i (3,1) K i (4,1) P i (5,1) U
i(1,2) B i(2,2) G i (3,2) L i (4,2) Q i (5,2) V
i(1,3) C i(2,3) H i (3,3) M i (4,3) R i (5,3) W
i(1,4) D i(2,4) I i (3,4) N i (4,4) S i (5,4) X


3. for i= 1 to 5
for i= 1 to 5
input a (i,k)
next i
for p= 1 to 5
for q= 1 to 5
print a (p,q)
next q
next p

jwb

A (i,k) A (p,q)
A(1,1) a A(2,1) e A(3,1) i A(1,1) a A(2,1) e
A(1,2) b A(2,2) f A(3,2) j A(1,2) b A(2,2) f
A(1,3) c A(2,3) g A(3,3) k A(1,3) c A(2,3) g
A(1,4) d A(2,4) h A(3,4) l