Pagini recente » Cod sursa (job #235981) | Cod sursa (job #2843299) | Cod sursa (job #2794120) | Cod sursa (job #2476699) | Cod sursa (job #2851582)
#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
const int N=5e5+5;
ull v[N],temp[N];
void MergeSort(int st,int dr)
{
if(st<dr)
{
int mid=(st+dr)/2;
MergeSort(st,mid);
MergeSort(mid+1,dr);
int i=st,j=mid+1,k=0;
while(i<=mid && j<=dr)
if(v[i]<v[j])
temp[++k]=v[i++];
else temp[++k]=v[j++];
while(i<=mid) temp[++k]=v[i++];
while(j<=dr) temp[++k]=v[j++];
for(int l=1,i=st;l<=k;l++,i++)
v[i]=temp[l];
}
}
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
MergeSort(1,n);
for(int i=1;i<=n;i++)
out<<v[i]<<' ';
return 0;
}