MENGGESER ELEMEN ARRAY
input A : | | 1 | 2 | 3 | |
output kanan : | | | 1 | 2 | 3 |
output kiri : | 1 | 2 | 3 | | |
| 3 | 5 | |
B A Temp
temp ← A
A← B
B← Temp
A[4] ←A[3]
A[3]←A[2]
A[2]←A[1]
for (i=n+1; i>0;i++)
A[i]=A[i-1]
MENGGESER KE KIRI
#include <cstdlib>
#include <iostream>
#define maks5
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
class array{
friend ostream&operator<<(ostream&,const array&);
friend istream&operator>>(istream&, array&);
public :
array();
void cetak();
void geser_kiri();
private :
char a[5];
int posisi;
};
array::array(){
for(int i=0;i<5;i++)
a[i]='O';
}
void array::cetak(){
for(int i=0;i<5;i++)
cout<<a[i]<<" ";
}
ostream&operator<<(ostream& out,const array& keluar){
for (int i=0;i<5;i++)
out<<keluar.a[i]<<" ";
out<<endl;
return out;
}
istream&operator>>(istream& in, array& masuk){
int posisi;
for(int posisi=1;posisi<=5;posisi++){
cout<<"masukkan nilai array posisi ke "<<posisi<<"= ";
if (posisi>=0&&posisi<=5){
in>>masuk.a[posisi-1];
}
}
return in;
}
void array::geser_kiri(){
int n=5;
int temp=a[0];
for(int i=0;i<n;i++)
a[i]=a[i+1];
a[n-1]=temp;
}
int main(int argc, char** argv) {
array X;
cout<<"array masi kosong : "<<X;cin>>X;
cout<<endl<<"<isi array saat ini : "<<X;
X.geser_kiri();
cout<<"isi array setelah di geser kiri : "<<X;
system ("PAUSE");
return EXIT_SUCCESS;
}
MENGGESER KE KANAN
#include <iostream>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
class array{
friend ostream& operator<<(ostream&, const array&);
friend istream& operator>>(istream&, array&);
public:
array();
void cetak();
void geser_kanan();
private:
char a[5];
int posisi;
};
array::array(){
for(int i=0;i<5;i++)
a[i]='0';
}
void array::cetak(){
for(int i=0;i<5;i++)
cout<<a[i]<<" ";
}
ostream& operator<<(ostream& out, const array& keluar){
for(int i=0;i<5;i++)
out<<keluar.a[i]<<" ";
out<<endl;
return out;
}
istream& operator>>(istream& in, array& masuk){
int posisi;
for (int posisi=1; posisi<=5; posisi++){
cout<<"Masukkan Nilai Array Posisi Ke-"<<posisi<<"= ";
//in>>masuk.posisi;
if(posisi >= 0 && posisi <= 5){
//cout<<"masukkan elemen arraynya :";
in>>masuk.a[posisi-1];
}
}
return in;
}
void array::geser_kanan(){
int n=5;
int temp=a[n-1];
for(int i=n-1;i>=0;i--)
a[i+1]=a[i];
a[0]=temp;
}
int main(int argc, char** argv) {
array X;
cout<<"Program Menggeser Ke Kanan Elemen Array\n\n";
cout<<"Array Masih Kosong : "<<X;
cin>>X;
cout<<"Isi Array Saat Ini : "<<X;
X.geser_kanan();
cout<<"Isi Array Setelah Digeser Kanan : "<<X<<endl;
cout<<endl;
system("PAUSE");
return 0;
}
untuk rencana nomor 2 bisa dilihat di :
untuk rencana nomor 3 bisa dilihat di :
2. KASUS PPT 6.1
#include <iostream>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
class HitungRata{
friend ostream& operator<<(ostream&, HitungRata&);
friend istream& operator>>(istream&, HitungRata&);
public:
float rata();
private:
int n;
int A[20];
};
istream& operator>>(istream& in, HitungRata& a){
cout<<"Banyaknya data : ";
in>>a.n;
for(int i=0;i<a.n;i++){
cout<<"Masukkan data ke- : "<<i+1<<">";
in>>a.A[i];
}
return in;
}
float HitungRata::rata(){
float total=0;
for(int i=0;i<n;i++)total=total+A[i];
return(total/n);
}
ostream& operator<<(ostream& out,HitungRata& a){
out<<"Rata-rata dari "<<a.n<<"bilangan adalah : "<<a.rata()<<endl;
return out;
}
main()
{
HitungRata run;
cin>>run;
cout<<run;
system("PAUSE");
return 0;
}
3. KASUS PPT 6.5
#include <iostream>
#include <conio.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int x;
void findmod(float bil[], int n, float mod[]){
int total[100];
int k=1;
x=0;
for(int c=0;c<n;c++){
for(int i=(n-1);i>=0;i++){
if(bil[i]<bil[i-1]){
int temp;
temp=bil[i];
bil[i]=bil[i-1];
bil[i-1]=temp;
}
}
}
for(int c=0;c<n;c++){
total[c]=0;
for(int i=0;i<n;i++){
if(bil[c]==bil[i]){
total[c]++;
}
}
}
for(int c=0;c<n;c++){
if(total[c]>k){
k=total[c];
}
}
for(int c=0;c<n;c++){
if(x==0)
mod[x]=0;
else
mod[x]=mod[x-1];
if(total[c]==k){
if(bil[c]!=mod[x]){
mod[x]=bil[c];
x++;
}
}
}
int z=0;
for(int c=0;c<n;c++){
if(total[c]==k){
z++;
}
}
if(z==n){
x=0;
}
}
int main(){
int n;
float bil[100];
float mod[100];
cout<<" Banyak N : ";
cin>>n;
for(int c=0;c<n;c++){
cout<<"nilai "<<(c+1)<<" : ";
cin>>bil[c];
}
cout<<endl;
findmod(bil,n,mod);
if(x==0)
cout<<"tidak ada modus!"<<endl;
else{
cout<<"Modus : ";
for(int c=0;c<x;c++){
cout<<mod[c]<<" ";
}
}
return 0;
}
Untuk ppt no 6.2 dan 6.4 bisa dilihat di : http://ghaidaazzahra771.blogspot.co.id/2016/04/latihan-diktat-bab-7.html#more
untuk ppt nomor 6.3 dan 6.6 bisa dilihat di : http://hiwilmacleta.blogspot.co.id/search/label/Diktat7
4. EBOOK HOW TO SOLVE NOMOR 4
#include <iostream>
#include <conio.h>
#include <stdio.h>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) {
int a[20], i, j, k ,n;
cout<<" enter aray size : ";
cin>>n;
cout<<" enter aray "<<n<<" elemen : \n";
for(i=0;i<n;i++){
cin>>a[i];
}
cout<<" new aray elemen are : ";
for(i=0;i<n;i++){
for(j=i+1;j<n;){
if(a[j]==a[i]){
for(k=j;k<n;k++){
a[k]=a[k+1];
}
n--;
}
else{
j++;
}
}
}
for(i=0;i<n;i++){
cout<<a[i]<<" ";
}
}
5. EBOOK HOW TO SOLVE NOMOR 6
#include<iostream>
#include<conio.h>
using namespace std;
main()
{
int data[10] = {4, 1, 0, -9, 8, 5, -1, 2, 3, -7};
int elemen, ketemu,x;
cout <<"Data yang dicari : ";cin >> x;
ketemu = 0;
for(elemen=0; elemen<= 9; elemen++)
{
if (data[elemen] == x)
{ ketemu =!ketemu;
break;
}
}
if (ketemu == 0) cout << "Data tidak ditemukan ";
else cout << "Data ada di elemen : "<< elemen;
getch();
}
Untuk Ebook How To Solve Nomor 3 dan 5 bisa dilihat di :http://ghaidaazzahra771.blogspot.co.id/2016/04/latihan-diktat-bab-7.html#more
Untuk Ebook How To Solve Nomor 1, 2, dan 7 bisa dilihat di :http://hiwilmacleta.blogspot.co.id/search/label/Diktat7
Tidak ada komentar:
Posting Komentar