Pagini recente » Cod sursa (job #313836) | Cod sursa (job #652098) | Cod sursa (job #2512097) | Cod sursa (job #94503) | Cod sursa (job #325058)
Cod sursa(job #325058)
#include<fstream.h>
#define max 500000
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,a[max];
void cerne(int i,int n)
{int x,j=i,k=i;
while(2*j<=n&&a[k]<a[2*j])
{k=2*j;
if(2*j+1<=n&&a[k]<a[2*j+1])
k=2*j+1;
x=a[k];
a[k]=a[j];
a[j]=x;
j=k;
}
}
void filtrare(int i,int n)
{int x,k=i/2;
while(k&&a[i]>a[k])
{x=a[i];a[i]=a[k];a[k]=x;i=k;k/=2;}
}
void make_heap()
{
for(int i=n/2;i>0;i--)
cerne(i,n);
}
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
void afisare()
{
for(int i=1;i<=n;i++)
g<<a[i]<<' ';
}
void heapsort()
{int x;
make_heap();
for(int i=n;i>=2;i--)
{x=a[i];a[i]=a[1];a[1]=x;cerne(1,i-1);}
}
int main()
{citire();
heapsort();
afisare();
return 0;
}