1. Menggeser elemen array
Geser kiri (Algoritma)
Deklarasi:
void tambah (int a,int b,int c)
A[3]=integer
Deskripsi:
Write( "hasil
setelah geser ke kiri")
Write(“masukan bil
1 :")
Readß a[1]
Write(“masukan bil
2 : ")
Readßb[2]
Write("masukan
bil 3 : ")
Readß c[3]
tambah(a[1],b[2],c[3])
Geser kiri (Raptor)
Geser Kiri (C++)
Geser Kanan (Algoritma)
Deklarasi:
A [5]={20,21,22,23,24} => Integer
n=0,temp=A[4] => Integer
Deskripsi:
Write("Data yang lama\n")
for (n=0;n<5;n++)
Write(" "<<A[n])
Write("Data yang baru : ")
for(int i=5;i>0;i--)
A[i]=A[i-1]
A[0]=temp
for (n=0;n<5;n++)
Write(" "<<A[n])
Geser Kanan (Raptor)
Analisis:
Median :
1 1 2 2 2 3 4 5 5
f[1]=2
f[2]=3
f[3]=1
f[4]=1
f[5]=2
Median :
1 1 2 2 2 3 4 5 5
f[1]=2
f[2]=3
f[3]=1
f[4]=1
f[5]=2
Raptor Mencari Mean :
C++ Mencari Mean,Modus,Median:
#define SIZE 100
#include<iostream>
using namespace std;
float mean_function(float[],int);
float median_function(float[],int);
float mode_function(float[],int);
int main()
{
int i,n,choice;
float array[SIZE],mean,median,mode;
char a;
a='b';
while(a=='b')
{
system ("cls");
cout<<"===========================";
cout<<"\nPROGRAM MEAN, MEDIAN, MODUS\n";
cout<<"===========================\n";
cout<<"Masukan jumlah data = ";
cin>>n;
cout<<"=======================\n";
cout<<"data\n";
cout<<"=======================\n";
for(i=0; i<n; i++)
cin>>array[i];
do
{
cout<<"\n\tEnter pilihan\n\t1.Mean\n\t2.Median\n\t3.Mode\n\t4.Exit\n";
cin>>choice;
switch(choice)
{
case 1:
mean=mean_function(array,n);
cout<<"\nMean ="<<mean;
break;
case 2:
median=median_function(array,n);
cout<<"\n\tMedian = "<<median;
break;
case 3:
mode=mode_function(array,n);
cout<<"\n\tMode = "<<mode;
break;
case 4:
break;
default:
cout<<"salah kode";
break;
}
}while(choice!=4);
}
}
float mean_function(float array[],int n)
{
int i;
float sum=0;
for(i=0;i<n;i++)
sum=sum+array[i];
return (sum/n);
}
float median_function(float a[],int n)
{
float temp;
int i,j;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[j];
a[j]=a[i];
a[i]=temp;
}
}
if(n%2==0)
return (a[n/2]+a[n/2-1])/2;
else
return a[n/2];
}
float mode_function(float a[],int n)
{
return (3*median_function(a,n)-2*mean_function(a,n));
}
#include<iostream>
using namespace std;
float mean_function(float[],int);
float median_function(float[],int);
float mode_function(float[],int);
int main()
{
int i,n,choice;
float array[SIZE],mean,median,mode;
char a;
a='b';
while(a=='b')
{
system ("cls");
cout<<"===========================";
cout<<"\nPROGRAM MEAN, MEDIAN, MODUS\n";
cout<<"===========================\n";
cout<<"Masukan jumlah data = ";
cin>>n;
cout<<"=======================\n";
cout<<"data\n";
cout<<"=======================\n";
for(i=0; i<n; i++)
cin>>array[i];
do
{
cout<<"\n\tEnter pilihan\n\t1.Mean\n\t2.Median\n\t3.Mode\n\t4.Exit\n";
cin>>choice;
switch(choice)
{
case 1:
mean=mean_function(array,n);
cout<<"\nMean ="<<mean;
break;
case 2:
median=median_function(array,n);
cout<<"\n\tMedian = "<<median;
break;
case 3:
mode=mode_function(array,n);
cout<<"\n\tMode = "<<mode;
break;
case 4:
break;
default:
cout<<"salah kode";
break;
}
}while(choice!=4);
}
}
float mean_function(float array[],int n)
{
int i;
float sum=0;
for(i=0;i<n;i++)
sum=sum+array[i];
return (sum/n);
}
float median_function(float a[],int n)
{
float temp;
int i,j;
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[j];
a[j]=a[i];
a[i]=temp;
}
}
if(n%2==0)
return (a[n/2]+a[n/2-1])/2;
else
return a[n/2];
}
float mode_function(float a[],int n)
{
return (3*median_function(a,n)-2*mean_function(a,n));
}
Max-Min Algoritma:
Deklarasi :
Angka, jumlah, max, min => integer
Angka, jumlah, max, min => integer
Deskripsi:
Write("\tMencari Nilai Maksimal dan Minimum. (jumlah angka ditentukan)")
Write(<<"Masukkan Jumlah Angka : ")
Write("\tMencari Nilai Maksimal dan Minimum. (jumlah angka ditentukan)")
Write(<<"Masukkan Jumlah Angka : ")
Read<--jumlah
Write("Masukkan Angka : ")
Read<--angka
if (i == 1){
min=angka
max=angka
else if (min>angka)
min=angka
else if (max<angka)
max=angka
else {}
Write("Nilai Minimum : ")
if (i == 1){
min=angka
max=angka
else if (min>angka)
min=angka
else if (max<angka)
max=angka
else {}
Write("Nilai Minimum : ")
Read<--min
Write("Nilai Maksimal : ")
Write("Nilai Maksimal : ")
Read<--max
Max-Min C++:
Max-Min Raptor:
3. Menghilangkan duplikasi dari data yang diinputkan
Algoritma:
Deklarasi:
public:
Array1D()
void cetak()
void geser_kiri()
void geser_kanan()
private:
char A[5]
int posisi
void Array1D::cetak()
int posisi;
void Array1D::geser_kanan()
void Array1D::geser_kiri()
int n=5
int temp=A[0]
int n=5
int temp=A[n-1]
Deskripsi:
for(int i=0;i<5;i++)
A[i]='O'
for(int i=0;i<5;i++)
cout<<A[i]<<" "
for(int i=0;i<5;i++)
out<<x.A[i]<<" "
return out;
for (int posisi=1; posisi<=5; posisi++)
cout<<"\nMasukkan Nilai Array
Posisi Ke- : "
in>>x.posisi
if(posisi >= 0
&& posisi <= 5){cout<<"Masukkan Elemen Array : "
in>>x.A[posisi-1]
return in
for(int
i=n-1;i>=0;i--)
A[i+1]=A[i]
A[0]=temp
for(int i=0;i<n;i++)
A[i]=A[i+1]
A[n-1]=temp
Array1D x
Write("\t\t\tArray Masih Kosong :
")
Read<--x
Write("\nIsi Array Saat ini :
")
x.geser_kiri()
Write("Isi
Array Setelah di Geser Kiri :
")
x.geser_kanan()
Write("Isi
Array Setelah di Geser Kanan : ")
Write("\nUrutan Elemen Pada
Indeksnya Saat ini : ")
C++:
Raptor:
Kunjungi blog kelompok kami :
-Semoga Bermanfaat-
~Thank You~
XOXO
0 komentar
Posting Komentar