Pagini recente » Cod sursa (job #2960799) | Cod sursa (job #2786625) | Cod sursa (job #3199516) | Cod sursa (job #3290395) | Cod sursa (job #240503)
Cod sursa(job #240503)
#include <stdio.h>
#define NMAX 500005
int N,a[NMAX];
void QSort(int ls,int ld){
int i=ls,j=ld,x=a[(ls+ld)/2],aux;
do
{
while (i<=ld && a[i]<x) ++i;
while (j>=ls && a[j]>x) --j;
if (i<=j) aux=a[i],a[i]=a[j],a[j]=aux,++i,--j;
}
while (i<=j);
if (i<ld) QSort(i,ld);
if (j>ls) QSort(ls,j);
}
int main(){
int i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&N);
for (i=1;i<=N;++i) scanf("%d",&a[i]);
QSort(1,N);
for (i=1;i<=N;++i) printf("%d ",a[i]);
return 0;
}