Pagini recente » Cod sursa (job #3236577) | Borderou de evaluare (job #2297249) | Borderou de evaluare (job #1213894) | Cod sursa (job #3269921) | Cod sursa (job #241297)
Cod sursa(job #241297)
#include<iostream>
#include<stdio.h>
FILE *f=fopen("algsort.in","r"),*g=fopen("algsort.out","w");
long a[500002];
void qsort(long st,long dr)
{
long i=st,j=dr,m=a[(st+dr)/2],aux;
do
{
while(a[i]<m&&i<=j) i++;
while(a[j]>m&&i<=j) j--;
if(i<=j) aux=a[i],a[i]=a[j],a[j]=aux,i++,j--;
}while(i<=j);
if(st<j) qsort(st,j);
if(dr>i) qsort(i,dr);
}
int main()
{
long n,i;
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%ld",&a[i]);
qsort(1,n);
for(i=1;i<=n;i++)
fprintf(g,"%ld ",a[i]);
return 0;
}