Pagini recente » Rating Marian Titu (mt314159) | Cod sursa (job #2072831) | Istoria paginii runda/bkt2_oct2011 | Cod sursa (job #2074068) | Cod sursa (job #2850084)
#include <fstream>
using namespace std;
const int N = 5 * 1e5 + 5;
int v[N], aux[N], n;
void interclasare(int v[], int st, int dr)
{
int mij = (st + dr) / 2;
int i = st, j = mij + 1, k = st;
while (i <= mij && j <= dr)
{
if (v[i] <= v[j])
{
aux[k++] = v[i++];
}
else
{
aux[k++] = v[j++];
}
}
while (i <= mij)
{
aux[k++] = v[i++];
}
while (j <= dr)
{
aux[k++] = v[j++];
}
for (int p = 0; p < k; p ++)
{
v[p] = aux[p];
}
}
void ms(int v[], int st, int dr)
{
if (st == dr)
{
return;
}
int mij = (st + dr) / 2;
ms(v, st, mij);
ms(v, mij + 1, dr);
interclasare(v, st, dr);
}
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in >> n;
for (int i = 0; i < n; i ++)
{
in >> v[i];
}
ms(v, 0, n - 1);
for (int i = 0; i < n; i ++)
{
out << v[i] << ' ';
}
return 0;
}