Pagini recente » Cod sursa (job #1783304) | Cod sursa (job #51897) | Cod sursa (job #3337631) | Cod sursa (job #3322829) | Cod sursa (job #3310935)
#include <stdio.h>
#include <stdlib.h>
#define N 500000
int v[N];
void swap(int *p1, int *p2)
{
int aux = *p1;
*p1 = *p2;
*p2 = aux;
}
int part_2(int v[], int st, int dr)
{
int p = st;
for (int i = st; i < dr; i++)
{
if (v[i] <= v[dr])
{
swap(&v[p++], &v[i]);
}
}
swap(&v[p], &v[dr]);
return p;
}
void quick_sort(int v[], int st, int dr)
{
if (st >= dr)
{
return;
}
int p = part_2(v, st, dr);
quick_sort(v, st, p - 1);
quick_sort(v, p + 1, dr);
}
void shuffle(int v[], int n)
{
for (int i = n - 1; i > 0; i--)
{
long long r = (long long)rand() * rand();
int p = r % (i + 1);
swap(&v[i], &v[p]);
}
}
int main()
{
FILE *in, *out;
in = fopen("algsort.in", "r");
out = fopen("algsort.out", "w");
int n;
fscanf(in, "%d", &n);
for (int i = 0; i < n; i++)
{
fscanf(in, "%d", &v[i]);
}
//shuffle(v, n);
quick_sort(v, 0, n - 1);
for (int i = 0; i < n; i++)
{
fprintf(out, "%d ", v[i]);
}
fprintf(out, "\n");
fclose(in);
fclose(out);
return 0;
}