Pagini recente » Cod sursa (job #2045990) | Istoria paginii utilizator/lelfunxd | Profil Wigandex | Cod sursa (job #2056790) | Cod sursa (job #1115944)
#include <fstream>
#define DIM 10000005
using namespace std;
int v[DIM], w[DIM];
int f[65536];
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n, a, b, c, i, p;
int main() {
fin>>n>>a>>b>>c;
v[1] = b;
for (i=2;i<=n;i++) {
v[i] = (int)((1LL*a*v[i-1] + b) % c);
}
int mask = 0xffff; // mask = 255;
int a[] = {0, 16};
for (p = 0; p<=1; p++) {
// sortam dupa al p-lea grup de 8 biti numarat de la dreapta
for (i=0;i<=65535;i++)
f[i] = 0;
for (i=1;i<=n;i++)
f[ (v[i]>>a[p]) & mask ]++;
for (i=1;i<=65535;i++)
f[i] += f[i-1];
for (i=n;i>=1;i--) {
w[ f[ (v[i]>>a[p]) & mask ] ] = v[i];
f[ (v[i]>>a[p]) & mask ] --;
}
for (i=1;i<=n;i++)
v[i] = w[i];
}
for (i=1;i<=n;i+=10)
fout<<v[i]<<" ";
return 0;
}