Pagini recente » Cod sursa (job #705990) | Cod sursa (job #853951) | Cod sursa (job #2482668) | Cod sursa (job #2292058) | Cod sursa (job #1040433)
#include <stdio.h>
#define NMax 500005
int n, a[NMax], c[NMax];
void msort(int st, int dr);
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out","w", stdout);
int i;
scanf("%d", &n);
for (i=0; i<n; i++)
scanf("%d", &a[i]);
msort(0, n-1);
for (i=0; i<n; i++)
printf("%d ", a[i]);
printf("\n");
}
void msort(int st, int dr)
{
int mij, x, y, z;
if ((dr - st) < 1)
return;
mij = (st + dr) / 2;
msort(st, mij);
msort(mij+1, dr);
// interclasare
z = 0;
x = st;
y = mij+1;
while (x <= mij && y <= dr)
{
if (a[x] <= a[y])
c[z++] = a[x++];
if (a[x] > a[y])
c[z++] = a[y++];
}
while (x <= mij)
c[z++] = a[x++];
while (y <= dr)
c[z++] = a[y++];
for (x=st, y=0; x<=dr; x++, y++)
a[x] = c[y];
}