Pagini recente » Istoria paginii utilizator/bilalkaan | Cod sursa (job #2072983) | Cod sursa (job #1641197) | Cod sursa (job #2105129) | Cod sursa (job #826744)
Cod sursa(job #826744)
#include<fstream>
#include<cstdio>
#include<cstring>
#define maxn 500005
using namespace std;
ifstream f("algsort.in");
FILE*g=fopen("algsort.out","w");
const int base = 1023,pbase = 10;
int n,A[maxn],AUX[maxn],Count[base];
inline void radix ( int *A ){
int step = 0;
for ( int pasi = 1 ; pasi <= 4; ++pasi ){
for ( int i = 1 ; i <= n ; ++i ){
++Count[ (A[i]>>step)&base ];
}
for ( int i = 0 ; i <= base ; ++i ){
Count[i] += Count[i-1];
}
for ( int i = n ; i >= 1 ; --i ){
AUX[ Count[((A[i]>>step)&base)]-- ] = A[i];
}
step += pbase;
memcpy(A,AUX,sizeof(AUX));
for ( int i = 0 ; i <= base ; ++i ){
Count[i] = 0;
}
}
}
int main () {
f >> n;
for ( int i = 1 ; i <= n ; ++i ){
f >> A[i];
}
radix(A);
for ( int i = 1 ; i <= n ; ++i ){
fprintf(g,"%d ",A[i]);
}
fprintf(g,"\n");
f.close();
fclose(g);
return 0;
}