Pagini recente » Cod sursa (job #1705832) | Cod sursa (job #988418) | Cod sursa (job #1205675) | Cod sursa (job #2101604) | Cod sursa (job #3210932)
#include <fstream>
#include <cstdlib>
using namespace std;
const int N = 5e5;
int v[N], aux[N];
void interclasare(int v[], int st, int dr)
{
int m = (st + dr) / 2, i = st, j = m + 1, k = st;
while (i <= m && j <= dr)
{
if (v[i] <= v[j])
{
aux[k++] = v[i++];
}
else
{
aux[k++] = v[j++];
}
}
while (i <= m)
{
aux[k++] = v[i++];
}
while (j <= dr)
{
aux[k++] = v[j++];
}
for (int k = st; k <= dr; k++)
{
v[k] = aux[k];
}
}
void ms(int v[], int st, int dr)
{
if (st == dr)
{
return;
}
int m = (st + dr) / 2;
ms(v, st, m);
ms(v, m + 1, dr);
interclasare(v, st, dr);
}
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
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] << " ";
}
in.close();
out.close();
return 0;
}