Tuesday, December 3, 2013

Heap Sort elemen array

<pre>
#include <iostream>
using namespace std;
int main(){

int data[100];

int temp,i,j,n;

cout<< "Berapa data yang ingin anda urutkan!!!";

cin>>n;

cout<<endl;

for (i=0;i<n;i++)

{

cout<<"Bilangan ke- "<<i+1 <<":"<<"" ;

cin>>data[i];

}

cout<<endl<<" BEFORE SORT: ";

for (i=0;i<n;i++)

cout<<data[i]<<" ";

cout<<endl<<endl;

cout<<" AFTER SORT: ";

for(int i=1;i<n;i++)

{

temp = data[i];

j = i -1;

while(data[j]>temp && j>=0)

{

data[j+1] = data[j];

j++;

}

data[j+1] = temp;

}

for (i=0;i<n;i++)

{

cout<<data[i]<<"";

}

cout<<endl<<endl;

system(" PAUSE");

return 0;
}

Hasilnya:
</pre>

No comments:

Post a Comment