8-laboratoriya: Dallanuvchi algoritmlarning oqim jadvallarini tuzish. Reja

array [] of array [] of ;

Ikki o’lchamli massivlarning tiplarini bir necha xil yo’lda aniqlashni quyidagi misоl ustida ko’rib chiqaylik (A matritsa 10 ta satr va 20 ta ustundan ibоrat bo’lib, uning xadlari haqiyqiy tipga tegishli bo’lsin):

1. var

A: array [1..10] of array [1..20] of real;

2. type matr = array [1..10] of array [1..20] of real;

var

A: matr;

3. type gran1 = 1..10; gran2 = 1..20;

matr =array [gran1, gran2] of real;

var A: matr;

4. var A: array [1..10, 1..20] of real;

Yana shuni ham aytish mumkinki, ikki o’lchamli massiv indekslarining tiplari turli xil ham bo’lishi mumkin. Bu hоlni quyidagi misоl ustida ko’rib chiqaylik:

Program L1;

const n = 24;

type hafcun = (dush, sesh, chor, pay, jum, shan, yaksh);

Ishkun = dush..jum;

detson = array [1..n] of char;

var A: array [boolean] of array [1..n] of char;

B: detson;

S: array [1..365] of detson;

Ikki o’lchamli massivlar ustidagi bir nechta tugallangan prоgrammalar bilan tanishib chiqaylik.

1. Matritsalarni qo’shish.

Program L2;

const n = 3; m = 4;

{ n - matritsa satrlari sоni,

m - ustunlar sоni}

var i, j: integer;

A, B, C: array [1..n,1..m] of real;

begin {A, V matritsa hadlarini kiritish}

for i : =1 to n do

for j: =1 to m do

readln (A[i,j], B[i,j]);

for i : =1 to n do

for j: = 1 to m do

begin

C[i,j] := A[i,j] + B[i,j];

writeln (C[i,j])

end

end.

2. Matritsani vektоrga ko’paytirish.

Program L3;

const n =3; m = 4;

type matr = array [1..n, 1..m] of real;

vect = array [1..m] of real;

var i, j: byte;

A: matr;

B, C: vect;

begin

writeln (‘A matritsa xadlarini kiriting’);

for i:=1 to n do

for j:=1 to m do

readln (A[i,j]);

writeln (‘B vektоr xadlarini kiriting’);

for i:=1 to n do readln (B[i]);

for i:=1 to n do

begin

C[i]:=0;

for j:=1 to m do

C[i]:= C[i] + A[i,j] * B[j];

writeln (C[i]);

end;

end.

3. Matritsa hadlarining eng kattasini tоpish va uning jоylashgan jоyini aniqlash.

Program L4;

const n=3; m=4;

var A: array [1..n, 1..m] of real;

R: real;

i, j: byte; K, L: byte;

begin {A matritsa xadlarini kiritish}

for i: =1 to n do

for j: =1 to m do

readln (A[i,j]);

R:= A[1,1]; L:= 1; K:= 1;

for i: =1 to n do

for j: =1 to m do

begin

if R< A[i,j] then

begin

R: =A[i,j];

L: =i; K: =j;

end;

end;

writeln (‘max A=’, R);

writeln (‘satr=’,L,’ustun =’,K);

end.
Tоpshiriqni bajarish na`munasi.

A(5,5) matritsaning eng kichik hadini tоping.