Geokomputasi TGL352-06-Array & Matriks-2324.pdf

Geokomputasi

1. TGL-352 Geokomputasi Program Studi Teknik Geologi
Jurusan Teknik Geologi
Universitas Pattimura
Dr. Ir. Asep HP Kesumajana, MTArray dan Matrix

2. Definisi array
Array adalah satu set alokasi variable dengan
type yang sejenis
Setiap alokasi variable disebut elemen dari
array
Deklarasi array:
int IntArr[30];
Variabel IntArr memiliki 30 elemen
Indeks elemen dimulai dari 0
TGL-352 Geokomputasi4. Array dan Matriks 2
NminNmin+1Nmin+2Nmin+3 Nmin+…Nmax-2Nmax-1Nmax
0 1 2 3 Nmin+…Nmax-2Nmax-1Nmax

3. Cara akses Array
Cara akses elemen:
<namatabel>[<indeks>]
Contoh: int Tbint[10];
cout << Tbint [4]; // tercetak: 210
x = Tbint [0] + Tbint [5]; // x = 76
Tbint[9] = 88; // Elemen array indeks 9 menjadi 88
Tbint[10] ??? // Berada di luar range, tidak terdefinisi!! error

TGL-352 Geokomputasi4. Array dan Matriks 3
9 2 7-1210670-213488
0 1 2 3 4 5 6 7 8 9

4. Mengisi array
Memberi nilai langsung saat deklarasi:
int Z[10] = {8, 6, 7, 9, 3, 1, 0, 76, 99, -12};
Mengisi melalui keyboard dengan perulangan:
int Z[10];
for (int i=0;i<10;i++){
cin >> Z[i];
}
Mengisi melalui perhitungan perulangan:
int Z[10];
for (int i=0;i<10;i++){
Z[i] = i * 10 + 5;
}
TGL-352 Geokomputasi4. Array dan Matriks 4
int Z[10];
for (int i=0;i<10;i++){
cout <<i<<“-“<< Z[i]<<endl;
}

5. Membaca isi array
Menampilkan isi array (anggap array sudah diisi:
for (int i=0;i<10;i++){
cout << Z[i]<< “\n”;
}
Manipulasi menggunakan array (anggap array sudah diisi:
a=12;
for (int i=0;i<10;i++){
x = Z[i] * a + i * 100;
cout << x << “\n”;
}
TGL-352 Geokomputasi4. Array dan Matriks 5

6. var int max
Inisiasi max=Z[0]
For (i=0; i<N; i++){
If (max<Z[0])
max=Z[0]
}
Mencari Bilangan Terkecil / terbesar
Mencari Bilangan Terkecil
var int min
Inisiasi min=Z[0]
For (i=0; i<N; i++){
If (min>Z[0])
min=Z[0]
}
TGL-352 Geokomputasi4. Array dan Matriks 6
Mencari Bilangan Terbesar

7. sorting
T[10]={9,2,7,-1,210,67,0,-21,34,8}
If (T[0]>T[1])
VP=T[0];
T[0]=T[1];
T[1]=VP;
TGL-352 Geokomputasi4. Array dan Matriks 7

8. Matriks
Matriks adalah array 2 dimensi:
Deklarasi array:
int IntM[10][15];
Variabel IntM adalah array dgn jml baris = 10 dan kolom = 15 →=matriks
TGL-352 Geokomputasi4. Array dan Matriks 801234567891011121314
0
1
2
3
4
5
6
7
8
9

9. Mengisi matriks
Memberi nilai langsung saat deklarasi:
int Anya[3][5] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
11, 12, 13, 14, 15};
Agar lebih mudah di lihat:
int Anya[3][5] = { {1, 2, 3, 4, 5},
{6, 7, 8, 9, 10},
{11, 12, 13, 14, 15}};
Hasilnya sama:
TGL-352 Geokomputasi4. Array dan Matriks 9

10. Mengisi matriks
Mengisi melalui keyboard dengan perulangan:
int Anya[3][5];
for (int i=0;i<3;i++){
for (int j=0;j<5;j++){
cin << Anya[i][j]
}
}
Mengisi melalui perhitungan perulangan:
int Anya[3][5];
for (int i=0;i<3;i++){
for (int j=0;j<5;j++){
Anya[i][j] = i * 10 + j * 5;
}
TGL-352 Geokomputasi4. Array dan Matriks 10

11. TGL-352 Geokomputasi4. Array dan Matriks 11
// print out
int Anya[3][5] = { 1,2,3,4,5,6,7,8,9,
10,11,12,13,14,15};
for (int j=0;j<5;j++){
cout << "\t"<<j<<":";}
cout<<"\n";
for (int i=0;i<3;i++){
cout<<i<<":";
for (int j=0;j<5;j++){
cout <<"\t"<<Anya[i][j];}
cout<<endl;}
return 0;0:1:2:3:4:
0:12345
1:678910
2:1112131415

12. Matriks: Perkalian matrix dgn bilangan skalar
Int X=100;
for (int i=0;i<3;i++){
for (int j=0;j<5;j++){
Cnya[i][j]=Anya[i][j]*X; // Anya[i][j]*=X
}
}
TGL-352 Geokomputasi4. Array dan Matriks 12
// print out
for (int j=0;j<5;j++){
cout << "\t"<<j<<":";}
cout<<"\n";
for (int i=0;i<3;i++){
cout<<i<<":";
for (int j=0;j<5;j++){
cout <<"\t"<<Cnya[i][j];}
cout<<endl;}
return 0;

13. Penjumlahan Matriks
int Anya[3][5] = { 1, 2, 3, 4, 5,
6, 7, 8, 9, 10,
11, 12, 13, 14, 15};
int Bnya[3][5] = { 3, 3, 3, 3, 3,
6, 6, 6, 6, 6,
9, 9, 9, 9, 9};
int Dnya[3][5]
for (int i=0;i<3;i++){
for (int j=0;j<5;j++){
Dnya[i][j]=Anya[i][j]+Bnya[i][j]
}
}
TGL-352 Geokomputasi4. Array dan Matriks 13

14. Perkalian 2 Matriks
Beberapa contoh:
TGL-352 Geokomputasi4. Array dan Matriks 14

15. TGL-352 Geokomputasi4. Array dan Matriks 15
Matriks
Pemrograman: matriks = array 2 dimensi
baris kolom
Misalkan: int A[3][4];
 int B[4][5];
 int C[3][5];
Perkalian matriks: C=AxB
 3 x 4 4 x 5 3 x 5
&#3627408462;
00&#3627408462;
01
&#3627408462;
10&#3627408462;
11
&#3627408462;
20&#3627408462;
21

&#3627408462;
02&#3627408462;
03
&#3627408462;
12&#3627408462;
13
&#3627408462;
22&#3627408462;
23
&#3627408463;
00&#3627408463;
01
&#3627408463;
10&#3627408463;
11
&#3627408463;
02&#3627408463;
03
&#3627408463;
12&#3627408463;
13
&#3627408463;
04
&#3627408463;
14
&#3627408463;
20&#3627408463;
21
&#3627408463;
30&#3627408463;
31
&#3627408463;
22&#3627408463;
23
&#3627408463;
32&#3627408463;
33
&#3627408463;
24
&#3627408463;
34
x
&#3627408464;
00&#3627408464;
01&#3627408464;
02
&#3627408464;
10&#3627408464;
11&#3627408464;
12
&#3627408464;
20&#3627408464;
21&#3627408464;
22

&#3627408464;
03&#3627408464;
04
&#3627408464;
13&#3627408464;
14
&#3627408464;
23&#3627408464;
24
=

16. Perkalian 2 Matriks
TGL-352 Geokomputasi4. Array dan Matriks 16
c
00 = (a
00* b
00)+ (a
01 * b
10)+ (a
02 * b
20)+ (a
03 * b
30)
c
10 = (a
10* b
00)+ (a
11 * b
10)+ (a
12 * b
20)+ (a
13 * b
30)
c
01 = (a
00* b
01)+ (a
01 * b
11)+ (a
02 * b
21)+ (a
03 * b
31)
i=3 x 4=k k=4 x 5=j i=3 x 5=j
&#3627408462;
00&#3627408462;
01
&#3627408462;
10&#3627408462;
11
&#3627408462;
20&#3627408462;
21

&#3627408462;
02&#3627408462;
03
&#3627408462;
12&#3627408462;
13
&#3627408462;
22&#3627408462;
23
&#3627408463;
00&#3627408463;
01
&#3627408463;
10&#3627408463;
11
&#3627408463;
02&#3627408463;
03
&#3627408463;
12&#3627408463;
13
&#3627408463;
04
&#3627408463;
14
&#3627408463;
20&#3627408463;
21
&#3627408463;
30&#3627408463;
31
&#3627408463;
22&#3627408463;
23
&#3627408463;
32&#3627408463;
33
&#3627408463;
24
&#3627408463;
34
x
&#3627408464;
00&#3627408464;
01&#3627408464;
02
&#3627408464;
10&#3627408464;
11&#3627408464;
12
&#3627408464;
20&#3627408464;
21&#3627408464;
22

&#3627408464;
03&#3627408464;
04
&#3627408464;
13&#3627408464;
14
&#3627408464;
23&#3627408464;
24
=
for (int k=0;k<4;k++){
C[..][..] = A[..][k] * B[k][..]
}

17. for (int j=0;J<5;j++){
for (int k=0;k<4;k++){
C[..][j] = A[..][k] * B[k][j]
}}
Perkalian 2 Matriks
TGL-352 Geokomputasi4. Array dan Matriks 17
i=3 x 4=k k=4 x 5=j i=3 x 5=j
&#3627408462;
00&#3627408462;
01
&#3627408462;
10&#3627408462;
11
&#3627408462;
20&#3627408462;
21

&#3627408462;
02&#3627408462;
03
&#3627408462;
12&#3627408462;
13
&#3627408462;
22&#3627408462;
23
&#3627408463;
00&#3627408463;
01
&#3627408463;
10&#3627408463;
11
&#3627408463;
02&#3627408463;
03
&#3627408463;
12&#3627408463;
13
&#3627408463;
04
&#3627408463;
14
&#3627408463;
20&#3627408463;
21
&#3627408463;
30&#3627408463;
31
&#3627408463;
22&#3627408463;
23
&#3627408463;
32&#3627408463;
33
&#3627408463;
24
&#3627408463;
34
x
&#3627408464;
00&#3627408464;
01&#3627408464;
02
&#3627408464;
10&#3627408464;
11&#3627408464;
12
&#3627408464;
20&#3627408464;
21&#3627408464;
22

&#3627408464;
03&#3627408464;
04
&#3627408464;
13&#3627408464;
14
&#3627408464;
23&#3627408464;
24
=
c
00 = (a
00* b
00)+ (a
01 * b
10)+ (a
02 * b
20)+ (a
03 * b
30)
c
01 = (a
00* b
01)+ (a
01 * b
11)+ (a
02 * b
21)+ (a
03 * b
31)
c
02 = (a
00* b
02)+ (a
01 * b
12)+ (a
02 * b
22)+ (a
03 * b
32)
c
03 = (a
00* b
03)+ (a
01 * b
13)+ (a
02 * b
23)+ (a
03 * b
33)
c
04 = (a
00* b
04)+ (a
01 * b
14)+ (a
02 * b
24)+ (a
03 * b
34)

18. for (i=0;i<3;i++)}
for (int j=0;J<5;j++){
for (int k=0;k<4;k++){
C[i][j] = A[i][k] * B[k][j]
}}}
Perkalian 2 Matriks
TGL-352 Geokomputasi4. Array dan Matriks 18
i=3 x 4=k k=4 x 5=j i=3 x 5=j
&#3627408462;
00&#3627408462;
01
&#3627408462;
10&#3627408462;
11
&#3627408462;
20&#3627408462;
21

&#3627408462;
02&#3627408462;
03
&#3627408462;
12&#3627408462;
13
&#3627408462;
22&#3627408462;
23
&#3627408463;
00&#3627408463;
01
&#3627408463;
10&#3627408463;
11
&#3627408463;
02&#3627408463;
03
&#3627408463;
12&#3627408463;
13
&#3627408463;
04
&#3627408463;
14
&#3627408463;
20&#3627408463;
21
&#3627408463;
30&#3627408463;
31
&#3627408463;
22&#3627408463;
23
&#3627408463;
32&#3627408463;
33
&#3627408463;
24
&#3627408463;
34
x
&#3627408464;
00&#3627408464;
01&#3627408464;
02
&#3627408464;
10&#3627408464;
11&#3627408464;
12
&#3627408464;
20&#3627408464;
21&#3627408464;
22

&#3627408464;
03&#3627408464;
04
&#3627408464;
13&#3627408464;
14
&#3627408464;
23&#3627408464;
24
=
c
00 = (a
00* b
00)+ (a
01 * b
10)+ (a
02 * b
20)+ (a
03 * b
30)
c
10 = (a
10* b
00)+ (a
11 * b
10)+ (a
12 * b
20)+ (a
13 * b
30)
c
20 = (a
20* b
00)+ (a
21 * b
10)+ (a
22 * b
20)+ (a
23 * b
30)
c
23 = (a
20* b
03)+ (a
21 * b
13)+ (a
22 * b
23)+ (a
23 * b
33)

19. for (i=0;i<3;i++)}
for (int j=0;J<5;j++){
for (int k=0;k<4;k++){
C[i][j] = C[i][j] + A[i][k] * B[k][j]
}}}
Perkalian 2 Matriks
TGL-352 Geokomputasi4. Array dan Matriks 19
i=3 x 4=k k=4 x 5=j i=3 x 5=j
&#3627408462;
00&#3627408462;
01
&#3627408462;
10&#3627408462;
11
&#3627408462;
20&#3627408462;
21

&#3627408462;
02&#3627408462;
03
&#3627408462;
12&#3627408462;
13
&#3627408462;
22&#3627408462;
23
&#3627408463;
00&#3627408463;
01
&#3627408463;
10&#3627408463;
11
&#3627408463;
02&#3627408463;
03
&#3627408463;
12&#3627408463;
13
&#3627408463;
04
&#3627408463;
14
&#3627408463;
20&#3627408463;
21
&#3627408463;
30&#3627408463;
31
&#3627408463;
22&#3627408463;
23
&#3627408463;
32&#3627408463;
33
&#3627408463;
24
&#3627408463;
34
x
&#3627408464;
00&#3627408464;
01&#3627408464;
02
&#3627408464;
10&#3627408464;
11&#3627408464;
12
&#3627408464;
20&#3627408464;
21&#3627408464;
22

&#3627408464;
03&#3627408464;
04
&#3627408464;
13&#3627408464;
14
&#3627408464;
23&#3627408464;
24
=
c
00 = (a
00* b
00)+ (a
01 * b
10)+ (a
02 * b
20)+ (a
03 * b
30)
c
10 = (a
10* b
00)+ (a
11 * b
10)+ (a
12 * b
20)+ (a
13 * b
30)
c
20 = (a
20* b
00)+ (a
21 * b
10)+ (a
22 * b
20)+ (a
23 * b
30)
c
23 = (a
20* b
03)+ (a
21 * b
13)+ (a
22 * b
23)+ (a
23 * b
33)

20. Tugas
Buat perkalian 2 buah matrik
Buat input matrix (array 2D)
Buat output matrix
Buat Algorithma dan bagan alirnya
TGL-352 Geokomputasi4. Array dan Matriks 20