Pagini recente » Cod sursa (job #1092468) | Cod sursa (job #2523558) | Cod sursa (job #205335) | Cod sursa (job #2175960) | Cod sursa (job #1887663)
#include <stdio.h>
#include <stdlib.h>
int v[500000];
void qSort(int egin,int nd){
int b=egin,e=nd,aux,pivot=v[(egin+nd)/2];
while(b<=e){
while(v[b]<pivot) b++;
while(v[e]>pivot) e--;
if(b<=e){
aux=v[b]; v[b]=v[e]; v[e]=aux;
b++; e--;
}
}
if(egin<e) qSort(egin,e);
if(b<nd) qSort(b,nd);
}
int main()
{
FILE*fin,*fout;
int n,i;
fin = fopen("algsort.in" ,"r");
fout = fopen("algsort.out" ,"w");
fscanf(fin, "%d" ,&n);
for(i=0;i<n;i++)
fscanf(fin, "%d" ,&v[i]);
qSort(0,n-1);
for(i=0;i<n;i++)
fprintf(fout, "%d " ,v[i]);
fprintf(fout, "\n");
fclose(fin);
fclose(fout);
return 0;
}