Pagini recente » Cod sursa (job #1544758) | Cod sursa (job #264298) | Cod sursa (job #1552439) | Cod sursa (job #3201538) | Cod sursa (job #826736)
Cod sursa(job #826736)
#include <fstream>
#include <cstdio>
#include <cstring>
using namespace std;
const char InFile[]="algsort.in";
const char OutFile[]="algsort.out";
const int MaxN=500111;
const int LogRadix=16;
const int Steps=32/LogRadix;
const int Radix=1<<LogRadix;
ifstream fin(InFile);
FILE *fout=fopen(OutFile,"w");
int N,V[MaxN],Buffer[MaxN],F[Radix];
int main()
{
fin>>N;
for(register int i=1;i<=N;++i)
{
fin>>V[i];
}
fin.close();
int mask=Radix-1;
int p=0;
for(register int step=1;step<=Steps;++step)
{
for(register int i=1;i<=N;++i)
{
++F[(V[i]&mask)>>p];
}
for(register int i=1;i<Radix;++i)
{
F[i]+=F[i-1];
}
for(register int i=N;i>0;--i)
{
Buffer[F[(V[i]&mask)>>p]--]=V[i];
}
memset(F,0,sizeof(F));
for(register int i=1;i<=N;++i)
{
V[i]=Buffer[i];
}
p+=LogRadix;
mask<<=LogRadix;
}
for(register int i=1;i<=N;++i)
{
fprintf(fout,"%d ",V[i]);
}
fclose(fout);
return 0;
}