Pagini recente » Cod sursa (job #1852209) | Cod sursa (job #639234) | Cod sursa (job #860654) | Cod sursa (job #829961) | Cod sursa (job #822341)
Cod sursa(job #822341)
#include <stdio.h>
#define Nmax 500005
int a[Nmax],n;
void quick_sort (int st,int dr)
{
int i=st,j=dr,piv=a[(st+dr)/2],aux;
do
{
while (a[i]<piv)
++i;
while (a[j]>piv)
--j;
if (i<=j)
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
++i;
--j;
}
}
while (i<=j);
if (st<j)
quick_sort(st,j);
if (i<dr)
quick_sort(i,dr);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int i;
scanf("%d",&n);
for (i=1;i<=n;++i)
scanf("%d",&a[i]);
quick_sort(1,n);
for (i=1;i<=n;++i)
printf("%d ",a[i]);
return 0;
}