Pagini recente » Cod sursa (job #1693855) | Cod sursa (job #1391632) | Cod sursa (job #2587152) | Cod sursa (job #2265208) | Cod sursa (job #1856624)
#include <fstream>
#include <fstream>
#define nmax 500005
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[nmax],k[nmax],p[256];
int n,a,b,c;
int base;
long long basemax;
// baza 256
inline int cif(int r)
{
return ((r>>(8*base))&255);
}
int main()
{
int i,j;
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
basemax=4;
base=0;
while (base<basemax) {
for (i=0;i<=255;i++)
p[i]=0;
for (i=1;i<=n;i++)
p[cif(v[i])]++;
for (i=1;i<=255;i++)
p[i]+=p[i-1];
for (i=n;i>=1;i--)
k[p[cif(v[i])]--]=v[i];
for (i=1;i<=n;i++)
v[i]=k[i];
base++;
}
for (i=1;i<=n;i++)
g<<v[i]<<' ';
return 0;
}