Pagini recente » Cod sursa (job #572515) | Cod sursa (job #2487796) | Cod sursa (job #526835) | Cod sursa (job #912803) | Cod sursa (job #974454)
Cod sursa(job #974454)
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#define NMax 500000
#define INF 100000000000000000LL
int n;
int v[NMax+1];
int Divide(int li, int ls)
{
int st = li, dr = ls, x = v[li];
while (st < dr)
{
while (st < dr && x <= v[dr])
dr--;
v[st] = v[dr];
while (st < dr && x >= v[st])
st++;
v[dr] = v[st];
}
v[st] = x;
return st;
}
void quickSort(int li, int ls)
{
int m = Divide(li, ls);
if (m - 1 > li)
quickSort(li, m-1);
if (m + 1 < ls)
quickSort(m+1, ls);
}
int main()
{
FILE *f = fopen("algsort.in", "r");
FILE *g = fopen("algsort.out", "w");
fscanf(f, "%d", &n);
for (int i=1; i<=n; i++)
fscanf(f, "%d", &v[i]);
quickSort(1, n);
for (int i=1; i<=n; i++)
fprintf(g, "%d ", v[i]);
fclose(f); fclose(g);
return 0;
}