Pagini recente » Cod sursa (job #2613863) | Cod sursa (job #2023193) | Cod sursa (job #2490070) | Cod sursa (job #2523158) | Cod sursa (job #2540479)
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[100004],w[100004];
int detimp(int x,int y)
{
if(x<y)
{
int mid=(x+y)/2;
detimp(x,mid);
detimp(mid+1,y);
int i=x,j=mid+1,k=x-1;
while(i<=mid && j<=y)
{
if(v[i]<v[j])
{
w[++k]=v[i];
i++;
}
else
{
w[++k]=v[j];
j++;
}
}
for(;i<=mid;i++)
w[++k]=v[i];
for(;j<=y;j++)
w[++k]=v[j];
for(i=x;i<=k;i++)
v[i]=w[i];
}
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
detimp(1,n);
for(int i=1; i<=n; i++)
fout<<v[i]<<" ";
return 0;
}