Kamis, 17 Maret 2011

PROGRAM SELECTION SORT C++

#include
#include

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

void tukar(int a, int b)
{
int t;
t = data[b];
data[b] = data[a];
data[a] = t;
}
void selection_sort()
{
int pos,i,j;
for(i=1;i<=n-1;i++) { pos = i; for(j = i+1;j<=n;j++) { if(data[j] < data[pos]) pos = j; } if(pos != i) tukar(pos,i); } } void main() { cout<<"===PROGRAM SELECTION SORT==="<>n;
for(int i=1;i<=n;i++) { cout<<"Masukkan data ke "<>data[i];
data2[i]=data[i];
}

selection_sort();

cout<<"\n\n";
//tampilkan data
cout<<"Data Setelah di Sort : ";
for(int i=1; i<=n; i++)
{
cout<<" "< }
cout<<"\n\nSorting Selesai";
getch();
}

Tidak ada komentar:

Posting Komentar