Pengurutan Dengan Bubble Sort Dan Insection Sort
Posted by Budi Arieyanto | Posted in Borlant C++ | Posted on 02.45
#include <iostream.h>
#include <stdio.h>
#include <conio.h>
int data[10],data2[10];
int n;
void tukar(int a,int b)
{
int temp;
temp = data[b];
data[b] = data[a];
data[a] = temp;
}
void bubble_sort()
{
for(int i=1;i<n;i++)
{
for(int j=n-1;j>=i;j--)
{
if(data[j]<data[j-1]) tukar(j,j-1);
}
}
cout<<"bubble sort selesai!"<<endl;
}
void Input()
{
cout<<"Masukkan jumlah data = ";cin>>n;
for(int i=0;i<n;i++)
{
cout<<"Masukkan Nilai ke-"<<i<<"=";cin>>data[i];
data2[i] = data[i];
}
}
void Tampil()
{
cout<<"----------------------"<<endl;
cout<<"Data : ";
for(int i=0;i<n;i++)
{
cout<<data[i];
}
cout<<endl;
}
void cari()
{
int posisi=0, i, ketemu;
int k;
cout<<"Masukkan data yang dicari : ";
cin>>k;
if (n <= 0)
posisi = -1;
else
{
ketemu = 0;
i = 1;
while ((i < n-1) && ! ketemu)
if (data[i] == k)
{
posisi = i;
ketemu = 1;
cout<<"Data ketemu : "<<data[i]<<" pada posisi : "<<i;
}
else
i++;
if (!ketemu)
posisi = -1;
}
}
void main()
{
clrscr();
int pil;
do
{
clrscr();
cout<<endl;
cout<<" ------------------------"<<endl;
cout<<" | MENU |"<<endl;
cout<<" ========================"<<endl;
cout<<" |>> 1.Input Data <<|"<<endl;
cout<<" |>> 2.Bubble Sort <<|"<<endl;
cout<<" |>> 3.Tampilkan Data <<|"<<endl;
cout<<" |>> 4.Pencarian <<|"<<endl;
cout<<" |>> 5.Exit <<|"<<endl;
cout<<" |----------------------|"<<endl;
cout<<" Pilihan = ";
cin>>pil;
switch(pil)
{
case 1:Input();break;
case 2:bubble_sort();break;
case 3:Tampil();break;
case 4:cari();break;
}
getch();
}
while(pil!=5);
}


Comments (0)
Posting Komentar