Friday, April 20, 2012

Bubble Sort & Sequential Search Menu


#include <iostream>
#include <conio.h>


using namespace std;


int data[100],data2[100];
int n;


int tukar(int a,int b)
{
int t;
t = data[b];
data[b] = data[a];
data[a] = t;
}


int 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!\n";
}


int Sequen_search()
{
int cari,index;
int ketemu=0;
cout<<"masukkan data yang ingin dicari = ";
cin>>cari;
for(int i=0;i<n;i++)
{
if(data[i] == cari)
{
ketemu=1;
index = i;
break;
}
}
if(ketemu == 1)
{
cout<<"Data ada"<<endl;
cout<<"Data terletak di index ke  "<<index;
}
else cout<<"Data Tidak ada"<<endl;
getch();
}


void Input()
{
cout<<"Masukkan jumlah data = "; cin>>n;
for(int i=0;i<n;i++)
{
cout<<"Masukkan data ke-"<<(i+1)<<" = "; cin>>data[i];
data2[i] = data[i];
}
}


int Tampil()
{
cout<<"Data : "<<endl;
for(int i=0;i<n;i++)
{
cout<<data[i]<<" ";
}
cout<<endl;
}


int main()
{
int pil;
system("cls");
do
{
system("cls");
cout<<"Program Sorting Searching"<<endl;
cout<<"**************************************"<<endl;
cout<<" 1. Input Data"<<endl;
cout<<" 2. Bubble Sort"<<endl;
cout<<" 3. Sequential Search"<<endl;
cout<<" 4. Tampilkan Data"<<endl;
cout<<" 5. Exit"<<endl;
cout<<"Pilihan Anda = ";  cin>>pil;
switch(pil)
{
case 1:Input(); break;
case 2:bubble_sort(); break;
case 3:Sequen_search();break;
case 4:Tampil(); break;
}
getch();
}
while(pil!=5);
}

No comments:

Post a Comment