#include<string.h>
int m, n;
int jumlah[10][10];
int kali[10][10];
int A[10][10],i,j,determinan;
matriks22 a,b,c;
int i,j;
int i, j;
for(j=1;j<=kolom;j++)
scanf("%d", &mat[i][j]);
void matriks_jumlah(const int matriks[10][10], const int matriks2[10][10], int baris, int kolom, int
jumlah [10][10])
{
int i, j;
for(j = 0;j<=kolom;j++)
int i,j;
printf("\n");
for(i = 1;i<=baris;i++)
for(j = 1;j<=kolom;j++)
printf("\n");
void matriks_kali(const int matriks[10][10], const int matriks2[10][10], int baris, int kolom, int
kali[10][10])
int i, j;
{
for(j = 0;j<=kolom;j++)
//Program Utama
int main()
do
printf("NIM\t: 205060300111041\n\n\n");
printf("\n1.Penjumlahan Matriks");
printf("\n2.Perkalian Matriks");
printf("\n3.Determinan Matriks\n");
scanf("%d", &pilihan);
switch(pilihan)
case 1 :
printf("\n\n=================\n");
cetak_matriks(matriks1,m,n);
printf("\n\n=================\n");
baca_matriks(matriks2, m, n);
cetak_matriks(matriks2, m, n);
cetak_matriks(jumlah,m,n);
break;
case 2 :
scanf("%d", &m);
scanf("%d", &n);
printf("\n\n=================\n");
baca_matriks(matriks1,m,n);
cetak_matriks(matriks1,m,n);
printf("\n\n=================\n");
baca_matriks(matriks2, m, n);
cetak_matriks(matriks2, m, n);
cetak_matriks(kali,m,n);
break;
case 3 :
scanf("%d", &pilihan);
switch(pilihan)
case 1:
//inputan
for(i=1;i<=2;i++)
for(j=1;j<=2;j++)
//Tampilkan matriks
for (i=1;i<=2;i++)
for(j=1;j<=2;j++)
printf("%d\t", A[i][j]);
printf("\n");
printf("\t\t\t");
determinan = (A[1][1]*A[2][2])-(A[1][2]*A[2][1]);
case 2:
for(i=1;i<=3;i++)
for(j=1;j<=3;j++)
scanf("%d", &A[i][j]);
//Tampilkan matriks
for (i=1;i<=3;i++)
for(j=1;j<=3;j++)
printf("%d\t", A[i][j]);
printf("\n");
printf("\t\t\t");
determinan = ((A[1][1]*A[2][2]*A[3][3])+(A[1][2]*A[2][3]*A[3][1])+
(A[1][3]*A[2][1]*A[3][2])) - ((A[3][1]*A[2][2]*A[1][3])+(A[3][2]*A[2][3]*A[1][1])+(A[3][3]*A[2]
[1]*A[1][2]));
break;
break;
}
break;
break;
scanf("%s", &lanjut);
while((lanjut=='y')||(lanjut=='Y'));
return 0;
}
Tugas No.2 : Program Pengurut Data
#include <iostream>
int A[]={17,30,4,6,87,1,12,32,55,2};
int n=10;
//Bubble Sorting
void SortingDesc()
int i,j,temp;
for (i=0;i<n;i++)
for (j=n-1;j>i;j--)
if (A[j]>A[j-1])
temp = A[j];
A[j] = A[j-1];
A[j-1] = temp;
//Bubble Sorting
void SortingAscen()
int i,j,temp;
for (i=0;i<n;i++)
for (j=n;j>i;j--)
if (A[j]<A[j-1])
temp = A[j];
A[j] = A[j-1];
A[j-1] = temp;
void show()
int i;
for (i=0;i<n;i++)
cout<<A[i]<<" ";
int main()
cout<<"NIM : 205060300111041"<<endl;
int pil;
show();
cin>>pil;
switch(pil)
case 1:
SortingDesc();
show();
break;
case 2:
SortingAscen();
show();
break;
cout<<endl;
return 0;