Pagini recente » Cod sursa (job #2391311) | Cod sursa (job #226704) | Cod sursa (job #2660158) | Cod sursa (job #3177561) | Cod sursa (job #2642699)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("algsort.in");
ofstream cout ("algsort.out");
int n;
int v[500005], tmp[500005], cnt[256], nr[256];
int main() {
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int j = 0; j < 4; j++) {
for(int i = 1; i <= n; i++)
cnt[(v[i] >> (j * 8)) & 255]++;
for(int i = 1; i < 256; i++)
cnt[i] += cnt[i - 1];
for(int i = 1; i <= n; i++) {
int k = ((v[i] >> (j * 8)) & 255);
nr[k]++;
tmp[(k > 0 ? cnt[k - 1] : 0) + nr[k]] = v[i];
}
for(int i = 1; i <= n; i++)
v[i] = tmp[i];
for(int i = 0; i < 256; i++)
cnt[i] = nr[i] = 0;
}
for(int i = 1; i <= n; i++)
cout << v[i] << " ";
return 0;
}