Pagini recente » Cod sursa (job #2085098) | Cod sursa (job #1292465) | Cod sursa (job #2079172) | Cod sursa (job #1383169) | Cod sursa (job #1987350)
#include <iostream>
#include <fstream>
using namespace std;
int n,a[500001],va[500001];
void interclaseaza(int inc,int sf){
int mij=(inc+sf)/2,i,ind1,ind2;
for(i=inc,ind1=inc,ind2=mij+1;i<=sf;i++){
if(ind2>sf||(ind1<=mij&&a[ind1]<a[ind2]))
va[i]=a[ind1++];
else
va[i]=a[ind2++];
}
for(i=inc;i<=sf;i++)a[i]=va[i];
}
void sorteaza(int inc,int sf){
if(inc!=sf){
int mij=(inc+sf)/2;
sorteaza(inc,mij);
sorteaza(mij+1,sf);
interclaseaza(inc,sf);
}
}
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;
}