Pagini recente » Cod sursa (job #2287783) | Cod sursa (job #896468) | Cod sursa (job #1547650) | Cod sursa (job #227757) | Cod sursa (job #1984067)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[500001],va[500001];
void interclaseaza(int inc, int sf){
int mij=(inc+sf)/2,it=0;
int ind1=inc,ind2=mij+1;
for(int i=1;i<=sf-inc+1;i++){
if(ind2>sf||a[ind1]<a[ind2]){
va[++it]=a[ind1];
ind1++;
} else {
va[++it]=a[ind2];
ind2++;
}
}
for(int i=1,j=inc;i<=it;i++,j++) a[j]=va[i];
}
void sorteaza(int inc,int sf){
if(inc!=sf){
int mij=(inc+sf)/2;
sorteaza(inc,mij);
sorteaza(mij+1,sf);
// cout<<inc<<" "<<sf<<'\n';
// for(int i=1;i<=n;i++)cout<<a[i]<<" ";cout<<"\n";
interclaseaza(inc,sf);
//for(int i=1;i<=n;i++)cout<<a[i]<<" ";cout<<"\n\n";
}
}
int main()
{
ifstream f ("algsort.in");
ofstream g ("algsort.out");
f>>n;
for(int i=1;i<=n;i++)f>>a[i];
sorteaza(1,n);
for(int i=1;i<=n;i++)g<<a[i]<<" ";
f.close ();
g.close ();
return 0;
}