Pagini recente » Cod sursa (job #1082131) | Cod sursa (job #662772) | Cod sursa (job #662679) | Cod sursa (job #661940) | Cod sursa (job #661870)
Cod sursa(job #661870)
#include <iostream>
#include <fstream>
#define DIM 500000
using namespace std;
int a[DIM];
void interclas(int i,int m,int j)
{int b[DIM];
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()
{
int i,n;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
divimp(1,n);
for(int i=1;i<=n;i++)
g<<a[i]<<" ";
return 1;
}