Pagini recente » Cod sursa (job #2067953) | Cod sursa (job #2482734) | Cod sursa (job #1241458) | Cod sursa (job #48268) | Cod sursa (job #2533646)
#include <fstream>
#define DIM 500010
using namespace std;
int n,i,v[500010],w[500010];
void interclas(int st, int mid, int dr){
int k=st-1;
int i=st;
int j=mid+1;
while (i<=mid&&j<=dr){
if (v[i]<v[j]){
w[++k]=v[i++];
}
else{
w[++k]=v[j++];
}
}
for (;i<=mid;i++){
w[++k]=v[i];
}
for (;j<=dr;j++){
w[++k]=v[j];
}
for (i=st;i<=dr;i++){
v[i]=w[i];
}
}
void sorts(int st,int dr){
if (st<dr){
int mid=(st+dr)/2;
sorts(st,mid);
sorts(mid+1,dr);
interclas(st,mid,dr);
}
}
int main() {
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
sorts(1,n);
for (i=1;i<=n;i++)
fout<<v[i]<<" ";
return 0;
}