belajar perkalian matrix dengan aray c++

#include <iostream>
#include <math.h>
using namespace std;

int main()
{
int aray[5][5];
int aray3[5][5];
int aray2[5][5];
int a,b,c,d;

cout<<"masukan jumlah baris = "<<endl;
cin>>a;
cout<<"masukan jumlah kolom = "<<endl;
cin>>b;

cout<<"matriks a"<<endl;
for(c=0;c<a;c++)
{
for(d=0;d<b;d++)
{

cout<<"masukan indeks ke ["<<c<<"]["<<d<<"] ="<<endl;
cin>>aray[c][d];
}
}
cout<<"matriks b"<<endl;
for(c=0;c<a;c++)
{
for(d=0;d<b;d++)
{
cout<<"masukan indeks ke ["<<c<<"]["<<d<<"] ="<<endl;
cin>>aray2[c][d];
}
}

cout<<"\n\n"<<endl;

for(c=0;c<a;c++)
{
for(d=0;d<b;d++)
{
aray3[c][d] = aray[c][d]+aray[c][d]; //penjumlahan

/*aray3[c][d]=0;
for(g=0;g<b;g++)
{ //perkalian
aray3[c][d] += aray[c][g]*aray[g][d];
}*/
}
}

for(c=0;c<a;c++)
{
for(d=0;d<b;d++)
{
cout<<aray3[c][d]<<"\t";
}
cout<<endl;
}
}


buble sort

ascending

#include <conio.h>
#include <iostream>
using namespace std;
int main()
{
int i,k,m,temp;
int L[5];
//Jumlah elemen dalam array ada 5
/*L[0]=1;
L[1]=50;
L[2]=10;
L[3]=3;
L[4]=2;*/
//Proses secara Ascending(naik)

cout<<"masukan jumlah data =\n";
cin>>m;

for(k=0;k<=m;k++)
{
cout<<"masukan nilai = \n";
cin>>L[k];
}

for(i=0;i<=m;i++)
{
  for(k=0;k<=m;k++)
  {
   if (L[k]>L[k+1])
    {
temp=L[k];
     L[k]=L[k+1];
     L[k+1]=temp;
}
  }
}
for(i=0;i<=m;i++)
{
cout<<L[i]<<endl;
}
getch();

}

descending

#include <conio.h>

#include <iostream>

using namespace std;

int main(){

int i,k,m,temp;

int L[20];

//kumlah elemen dalam Lay ada 5

cout<<"masukan kumlah data =\n";

cin>>m;

for(i=0;i<=m;i++)

{

cout<<"masukan nilai = \n";

cin>>L[i];

}

//Proses secara Descending(menurun)

for(i=0; i<=m; i++)

{

       for(k=0; k<=m-i-1; k++)

       {

if(L[k] < L[k+1])

{

temp = L[k];

L[k] = L[k+1];

L[k+1] = temp;

}

       }

}

for(i=0;i<=m;i++)

{

cout<<L[i]<<endl; 

}

getch();

}


==============================================================
insertsion asc

#include <stdio.h>
#include <conio.h>
#include <iostream>
using namespace std;
int main(){
int j,k,m, temp;
int L[5];
/*
L[1]=1;
L[2]=25;
L[3]=10;
L[4]=30;
L[5]=2;*/
cout<<"masukan jumlah data = ";
cin>>m;

for(j=0;j<m;j++)
{
cout<<"masukan data = ";
cin>>L[j];
}

for(k=0;k<m;k++){
 temp=L[k];/* ambil elemen L[k] supaya tidak tertimpa penggeseran*/
 /* Cari Posisi Yang tepat dalam L[1..k-1] sambil menggeser*/
 j=k-1;
    while(temp<=L[j])
    {
    L[j+1]=L[j];
    j--;
 }
if((temp >= L[j])|| ( j=1))
  L[j+1]=temp; /*posisi yg tepat untuk L[k] ditemukan*/
  else
  {
  L[j+1]=L[j];
  L[j]=temp;
  }
}
for(k=0;k<m;k++)
 cout<< L[k]<<"   ";

getch();}

======================================================
selection
======================================================
max ascending
******************************************
#include <iostream>

using namespace std;

int main(){
int A[5];
int j, k, i, temp;
int jmax, u=4;

cout << "Masukkan nilai sebelum diurutkan\n";
cout << "Maukkan nilai pada elemen array: "<<endl;

for(i=0; i<5; i++){
cout << "A["<<i<<"]=";
cin>> A[i];
}

cout << "\nNilai elemn Array sebelum diurutkan = " <<endl;

for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

for(j=0; j<5; j++){
jmax=0;
for(k=1; k<=u; k++ )
if(A[k]>A[jmax])
jmax=k;

temp = A[u];
A[u] = A[jmax];
A [jmax] = temp;
u--;


cout << "Hasil proses ke-" << j+1<< " = ";
for(k=0; k<5; k++)
cout << A[k] << " ";
cout << endl;
}

cout << "\nNilai setelah diuturkan = " <<endl;
for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

}
***************************
max descending
***************************
#include <iostream>

using namespace std;

int main(){
int A[5];
int j, k, i, temp;
int jmax, u=4;

cout << "Masukkan nilai sebelum diurutkan\n";
cout << "Maukkan nilai pada elemen array: "<<endl;

for(i=0; i<5; i++){
cout << "A["<<i<<"]=";
cin>> A[i];
}

cout << "\nNilai elemn Array sebelum diurutkan = " <<endl;

for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

for(j=0; j<5; j++){
jmax=0;
for(k=1; k<=u; k++ )
if(A[k]<A[jmax])
jmax=k;

temp = A[u];
A[u] = A[jmax];
A [jmax] = temp;
u--;


cout << "Hasil proses ke-" << j+1<< " = ";
for(k=0; k<5; k++)
cout << A[k] << " ";
cout << endl;
}

cout << "\nNilai setelah diuturkan = " <<endl;
for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

}
***************************************
min ascending
***************************************
#include <iostream>

using namespace std;

int main(){
int A[5];
int j, k, i, temp;
int jmin, u=4;

cout << "Masukkan nilai sebelum diurutkan\n";
cout << "Maukkan nilai pada elemen array: "<<endl;

for(i=0; i<5; i++){
cout << "A["<<i<<"]=";
cin>> A[i];
}

cout << "\nNilai elemn Array sebelum diurutkan = " <<endl;

for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

for(j=0; j<5; j++){
jmin=j;
for(k=j; k<5; k++ )
if(A[jmin]>A[k])
jmin=k;

temp = A[j];
A[j] = A[jmin];
A [jmin] = temp;



cout << "Hasil proses ke-" << j+1<< " = ";
for(k=0; k<5; k++)
cout << A[k] << " ";
cout << endl;
}

cout << "\nNilai setelah diuturkan = " <<endl;
for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

}
***********************************
min descending
***********************************
#include <iostream>

using namespace std;

int main(){
int A[5];
int j, k, i, temp;
int jmin, u=4;

cout << "Masukkan nilai sebelum diurutkan\n";
cout << "Maukkan nilai pada elemen array: "<<endl;

for(i=0; i<5; i++){
cout << "A["<<i<<"]=";
cin>> A[i];
}

cout << "\nNilai elemn Array sebelum diurutkan = " <<endl;

for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

for(j=0; j<5; j++){
jmin=j;
for(k=j; k<5; k++ )
if(A[jmin]<A[k])
jmin=k;

temp = A[j];
A[j] = A[jmin];
A [jmin] = temp;



cout << "Hasil proses ke-" << j+1<< " = ";
for(k=0; k<5; k++)
cout << A[k] << " ";
cout << endl;
}

cout << "\nNilai setelah diuturkan = " <<endl;
for(i=0; i<5; i++){
cout << A[i] << "  ";
}
cout <<"\n";

}

====================================
searching
==================================
***************************
sequential
****************************
#include <iostream>
using namespace std;
int main()
{
int data[5];
int index[5];
int a,b,c,d;

cout<<"masukan jumlah data = "<<endl;
cin>>a;

for(b=0;b<a;b++)
{
cout<<"masukan niali = "<<endl;
cin>>data[b];
}

cout<<"masukandata yg anda cari = "<<endl;
cin>>c;

d=0;
for(b=0;b<a;b++)
{
if(data[b] == c)
{
index[d]=b;
d++;
}
}

if(d>0)
{
for(b=0;b<d;b++)
{
cout<<index[b];
}
}
else
{
cout<<"data tidak ditemukan dalam aray"<<endl;
}
}

************************************
binary
*************************************
#include <iostream>
#include <conio.h>

using namespace std;

int main()
{
int data[10];
int a,b,c,d,e,low,high,mid,flag;

cout<<"masukan jumlah data = "<<endl;
cin>>a;

for(b=0;b<a;b++)
{
cout<<"masukan data = "<<endl;
cin>>data[b];
}

cout<<"masukan data yang anda cari = "<<endl;
cin>>c;

for(b=0;b<a;b++)
{
for(d=b+1;d<a;d++)
{
if(data[b]>data[d])
{
e=data[b];
data[b]=data[d];
data[d]=e;
}
}
}

flag=0;
high=a;
low=0;
while(low<=high)
{
mid=(low+high)/2;
if(data[mid]==c)
{
flag++;
}
if(data[mid]<c)
{
low=mid+1;
}
else
{
high=mid-1;
}
}

if(flag>0)
{
cout<<"data"<<c<<"yang di cari ada dalam aray"<<endl;
}
else
{
cout<<"data tidak ada"<<endl;
}
getch();
}