Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #241297)
Utilizator | Data | 9 ianuarie 2009 19:07:06 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#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;
}