Pagini recente » Cod sursa (job #2680749) | Cod sursa (job #2151635) | Cod sursa (job #1414888) | Cod sursa (job #2807700) | Cod sursa (job #2810950)
#include <bits/stdc++.h>
#define get_byte(x) ((x >> (8 * byte)) & 255)
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int v[500001];
void read()
{
f>>n;
for(int i = 1;i <= n;++i)
f>>v[i];
}
void countsort(int arr1[], int arr2[], int byte)
{
int counter[1 << 8], index[1 << 8];
memset(counter, 0, sizeof(counter));
for(int i = 1;i <= n;++i)
counter[get_byte(arr1[i])]++;
index[0] = 1;
for(int i = 1;i < (1 << 8);++i)
index[i] = index[i - 1] + counter[i - 1];
for(int i = 1;i <= n;++i)
arr2[index[get_byte(arr1[i])]++] = arr1[i];
}
void solve()
{
int *temp = new int[n + 1];
for(int i = 0;i < 4;++i)
if(i & 1)
countsort(temp, v, i);
else
countsort(v, temp, i);
delete temp;
for(int i = 1;i <= n;++i)
g<<v[i]<<" ";
}
int main()
{
read();
solve();
return 0;
}