01 SOAL
1. Pengurutan menggunakan metode Bubble Sort secara Ascending :
Fungsi :
//mengurutkan
data menggunakan metode bubble sort secara ascending
//Nama
: Dwicky Oktavian
//NIM : 181011450428
#include<iostream>
#include<conio.h>
using namespace std;
void bubblesort(int data[],int n);
main(){
cout<<"\t\t \tPengurutan Data
Bubble Sort secara Ascending"<<endl; cout<<endl;
int i;
int n=7;
int data[]={5,2,21,4,9,16,13,3};
cout<<"Data sebelum diurutkan
:"<<endl;
for(i=0;i<=n;i++)
cout<<data[i]<<" ";
cout<<endl;
cout<<"____________________"<<endl;
bubblesort(data,n);
cout<<"Data setelah diurutkan
:"<<endl;
for(i=0;i<=n;i++)
cout<<data[i]<<" ";
cout<<endl;
}
void bubblesort(int array1[], int n){ int
i,k,tmp;
for(i=1;i<=n;i++){
for(k=n;k>=i;k--){
if(array1[k]<array1[k-1]){ tmp=array1[k];
array1[k]=array1[k-1];
array1[k-1]=tmp;
}
}
}
}
Hasil
2. Pengurutan menggunakan
metode Selection Sort secara Descending :
Fungsi :
//mengurutkan data menggunakan metode
selection sort secara descending
//Nama : Dwicky Oktavian
//NIM : 181011450428
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
cout<<"\t\t
\tPengurutan Data Selection Sort secara Descending"<<endl;
cout<<"\t\t
\t================================================\n";
int i,j,Imaks,maks,temp;
int
L[8]={5,2,21,4,9,16,13,3};
for (i=7;i>=1;i--){
Imaks=0; maks=L[0];
for (j=1;j<=i;j++){
if (L[j]<maks){
Imaks=j; maks=L[j];
}
}
temp=L[i]; L[i]=maks;
L[Imaks]=temp;
}
cout<<"\nData
Sebelum diurutkan : "<<endl; int data[]={5,2,21,4,9,16,13,3};
for(i=0;i<=7;i++)
cout<<data[i]<<" "; cout<<endl;
cout<<" "<<endl;
cout<<"Data
setelah diurutkan :"<<endl; for (i=0;i<=7;i++){
cout<<L[i]<<"
";
}
cout<<endl; getch();
}
Hasil :
3. Pengurutan
menggunakan metode Insertion Sort secara Descending :
Fungsi :
//mengurutkan
data menggunakan metode insertion sort secara descending
//Nama
: Dwicky Oktavian
//NIM
: 181011450428
#include <iostream>
#include <conio.h>
#include <iomanip>
using namespace std;
void insertion (int data[])
{
int temp,j;
for(int i=1;i<8;i++)
{
temp=data[i]; j=i-1;
while(data[j]<temp && j>=0)
{
data[j+1]=data[j]; j--;
}
data[j+1]=temp;
}
}
int main()
{
//deklarasi variabel
int data [8]={5,2,21,4,9,16,13,3};
cout<<"\t\t \tPengurutan Data
Insertion Sort secara Descending"<<endl;
cout<<"\t\t
\t================================================\n";
cout<<endl;
cout<<"\nData Sebelum diurutkan :
"<<endl; cout<<" \n";
for(int n=0;n<8;n++)
cout<<data[n]<<" ";
cout<<endl;
cout<<"\nData Setelah
diurutkan\n"; cout<<" \n";
insertion(data);
for(int x=0;x<8;x++)
cout<<data[x]<<" ";
cout<<endl;
getch();
}
Hasil :
Buatlah pengurutan dari data dibahah ini
90 145 67 23 189 29 334 92 266 95
//mengurutkan data
menggunakan metode insertion sort secara descending
//Nama : Dwicky
Oktavian
//NIM : 181011450428
#include <iostream>
#include <conio.h>
#include <iomanip>
using namespace std;
void insertion (int data[])
{
int temp,j;
for(int i=1;i<10;i++)
{
temp=data[i]; j=i-1;
while(data[j]<temp && j>=0)
{
data[j+1]=data[j]; j--;
}
data[j+1]=temp;
}
}
int main()
{
//deklarasi variabel
int data [10]={90,145,67,23,189,29,334,92,266,95};
cout<<"\t\t \tPengurutan Data Insertion Sort secara
Descending"<<endl;
cout<<"\t\t
\t================================================\n";
cout<<endl;
cout<<"\nData Sebelum diurutkan : "<<endl; cout<<"
\n";
for(int n=0;n<10;n++) cout<<data[n]<<" ";
cout<<endl;
cout<<"\nData Setelah diurutkan\n"; cout<<" \n"; insertion(data);
for(int x=0;x<10;x++) cout<<data[x]<<" ";
cout<<endl;
getch();
}
Hasil :
0 komentar: