You are on page 1of 15

K THUT LP TRNH

Chng 1: Mng nhiu chiu


(multidimensional array)

Ni dung trnh by

3
1

Gii thiu

Khai bo mng

33

Khi to tr ban u cho mng

Truy xut mng

Mt s thao tc trn mng

1.Gii thiu
nh Ngha:
- Mng l mt dy cc phn t c cng kiu d liu
c sp xp lin tip nhau trong b nh my tnh.

1.Gii thiu v my tnh


- Mng bao gm :
- Mng 1 chiu:
V d: Int A[20] ;
Float B[10];
- Mng 2 chiu:
V d: int C [20] [20] ;
Float B[10][15];

1.Gii thiu

- Ngoi ra trong chuyn mn ngi ta pht


trin thm mt s dng mi nh sau:
+ Mng con tr
+ Mng k t.

2.Khai bo mng
- Khai bo mng 2 chiu:

V d:
Char DSSV[10][20];

// Danh sch sinh vin

cha ti a l 10 sinh vin;


//H v tn sinh vin cha
khng qu 20 k t

2.Khai bo mng
Trong :
Kiu_DL : l mt trong cc kiu d liu c
bn trong C hoc C++; Khi khai bo kiu d
liu ny th y chnh l kiu d liu cho tt
c cc phn t.
Tnmng: l tn ca mng c t mt
cch hp l.
Kch thc1: l 1 hng nguyn cho bit s
lng phn t ti a ca hng.
Kch thc2: l 1 hng nguyn cho bit s
lng phn t ti a ca ct.
7

2.Khai bo mng
* Lu :

- Mt mng trong C hoc C++ th cc


phn t c nh s t 0 n n-1;
V d:
Int M[10][10]
Phn t u tin l M[0][0];
Phn t cui cng l M[9][9];

2.Khai bo mng
- C v C++ khng kim tra xem bin m c
vt ra khi gii hn cho php ca mng
hay cha. Do khi lp trnh chng ta phi
kim tra bin m trong chng trnh sao
cho bin m phi nh hn n v m
V d:
Khai bo mng: Int M[6][8];
Khi thc hin lp trnh khng th truy
xut v gn tr l:M[6][9] hoc M[7][8]

3.Khi to tr ban u cho mng


Sau khi khai bo mng, ta c th khi to gi tr
ban u cho mng nh sau:
Gn trc tip gi tr cho cc phn t:
V d:
Int M[2][3] = {{1,2,3}
{2,3,4}}
Gn cho gi tr qua vng lp:
V d: Int M[2][3];
For ( int i= 0, i<3; i++)
For(int j=0, J<4; J++)
{ M[i][j]= j +1
}

4.Truy Xut Mng


truy xut phn t dng i, ct j trong mt mng 2
chiu th ta truy xut n thnh phn dng I+1 v J+1
ca mng 2 chiu ny.
V d:
Ta c mng int M[2][3]
Khi mn gn gi tr ca phn t M[1][2] th ta truy xut
n thnh phn dng 2 v ct 3 ca mng.

5. Mt s thao tc trn mng


c(Nhp) d liu cho mng:
nhp d liu cho mng ta phi nhp tng thnh
phn ca mng bng hm Scanf
v d:
int m, n, i, j;
float M[10] [10];
printf("So dong ="); scanf("%d",&n);
printf("So cot ="); scanf("%d",&m);
for(i= 0; i< n; i++)
for(j= 0; j<m; j++)
{ printf(M[%d] [%d] = ,i,j);
scanf(%f, &M[i][j]);
}

5. Mt s thao tc trn mng


Xut d liu cho mng:
xut d liu cho mng ta phi xut d liu
ca tng thnh phn ca mng bng hm
print.
V d:
int i, n;
float M[10];
for(i = 0; i< n; i++)
printf(a[%d] = %f,i+1,
M[i]);
13

Ti Liu Tham kho


Joel Adams & Larry Nyhoff, C++ An
Introduction to Computing, 3rd-Edition.
H.M. Deitel & P.J. Deitel, C++ How to
Program, Prentice Hall, New Jersey, 4th
Edition, 2003
Nguyn Hng Chng, cu trc d liu v gii
thut, 1999.
www.diendandaihoc.vn

Thc Hnh
- 1. Tinh tich cua 2 ma tran.
- 2. Cho ma tran va sap xep theo tung hang,
cot

You might also like