Cod sursa(job #1033504)
| Utilizator | Data | 17 noiembrie 2013 01:34:14 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
#define nmax 500001
using namespace std;
int v[nmax],w[nmax];
void Ordoneaza(int s,int d)
{
int i=s,m=(s+d)>>1,j=m+1,k=s;
for(;i<=m || j<=d;)
if(j>d || (i<=m && v[i]<v[j]))
w[k++]=v[i++];
else w[k++]=v[++j];
for(k=s;k<=d;++k)
v[k]=w[k];
}
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i;
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
Ordoneaza(1,n);
for(i=1;i<=n;++i)
g<<v[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}
