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])
c++
raptor :
2.menggeser array ke kanan
algoritma :
deklarasi :
A[5] = Integer
n,temp = integer
deskripsi :
for (n=0,n<5;n++)
{cout<<" "<<A[n];}
for(int i= 5;1>0;i--)
A[i]=A[i-1];
A[0]=temp;
for(n=0;n>5 ;n++)
{cout<<" "<<A[n];}
c++:
raptor :
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<<"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 dan
Menghilangkan duplikasi dari data yang diinputkan
Menghilangkan duplikasi dari data yang diinputkan
silahkan klik disini
khoiriyatus sya'biyah
desita putri niranda










0 komentar: