Pagini recente » Cod sursa (job #1141906) | Cod sursa (job #2298298) | Cod sursa (job #1716001) | Cod sursa (job #1819549) | Cod sursa (job #2438289)
#include<cstdio>
#define MAX_N 500000
int v[MAX_N], n;
void readArray() {
int i;
FILE* fin = fopen("algsort.in","r");
fscanf(fin,"%d",&n);
for(i = 0; i < n; i++)
fscanf(fin,"%d",&v[i]);
fclose(fin);
}
void quickSort(int Begin, int End) {
int b = Begin, e = End, pivot = v[(b+e)>>1];
while(b <= e) {
while(v[b] < pivot) b++;
while(v[e] > pivot) e--;
if(b <= e) {
int aux = v[b];
v[b] = v[e];
v[e] = aux;
b++;
e--;
}
}
if(Begin < e)
quickSort(Begin,e);
if(b < End)
quickSort(b,End);
}
void printArray() {
FILE* fout = fopen("algsort.out","w");
for(int i = 0; i < n; i++)
fprintf(fout,"%d ",v[i]);
fprintf(fout,"\n");
fclose(fout);
}
int main() {
readArray();
quickSort(0,n-1);
printArray();
return 0;
}