Pagini recente » Cod sursa (job #2119907) | Cod sursa (job #2839415) | Cod sursa (job #2416283) | Cod sursa (job #332437) | Cod sursa (job #948023)
Cod sursa(job #948023)
#include <fstream>
using namespace std;
fstream fin("algsort.in", ios::in);
fstream fout("algsort.out", ios::out);
long long a[500001],b[500001],n;
void interclas(int i,int m,int j)
{
int x=i;
int k=1;
int y=m+1;
while(x<=m && y<=j)
if (a[x]<a[y])
b[k++]=a[x++];
else
b[k++]=a[y++];
while (x<=m)
b[k++]=a[x++];
while (y<=j)
b[k++]=a[y++];
int t=i;
for (k=1;k<=(j-i)+1;k++)
a[t++]=b[k];
}
void divimp(int i,int j)
{
if (i<j)
{
int m=(i+j)/2;
divimp(i,m);
divimp(m+1,j);
interclas(i,m,j);
}
}
int main()
{
long long i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
divimp(1,n);
for(i=1;i<=n;i++)
fout<<a[i]<<' ';
fin.close(); fout.close();
return 0;
return 0;
}