Pagini recente » Cod sursa (job #906671) | Cod sursa (job #2568536) | Cod sursa (job #2600747) | Cod sursa (job #2452208) | Cod sursa (job #2557879)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i;
long long v[10000];
void Interclasare(int I1,int m,int I2)
{int t,i,j,k,nr;
long long a[10000];
for(t=I1;t<=I2;t++)a[t]=v[t];
i=I1;
j=m+1;
k=I1-1;
while(i<=m&&j<=I2)
{if(a[i]<a[j])
{v[++k]=a[i];
i++;
}else{v[++k]=a[j];
j++;
}
}
for(t=i;t<=m;t++)v[++k]=a[t];
for(t=j;t<=I2;t++)v[++k]=a[t];
}
void Divide(int st,int dr)
{if(st!=dr)
{int m=(st+dr)/2;
Divide(st,m);
Divide(m+1,dr);
Interclasare(st,m, dr);
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
Divide(1,n);
for(i=1;i<=n;i++)g<<v[i]<<' ';
return 0;
}