Pagini recente » Cod sursa (job #2905245) | Cod sursa (job #835426) | Cod sursa (job #2288363) | Cod sursa (job #25962) | Cod sursa (job #2817267)
#include <bits/stdc++.h>
#define oo 0x3f3f3f3f
#define get_byte(x) ((x >> (8 * byte)) & 0xff)
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int arr[500001];
void read()
{
f>>n;
for(int i = 1;i <= n;++i)
f>>arr[i];
}
void countsort(int *arr1, int *arr2, int byte)
{
int count[1 << 8];
int index[1 << 8];
memset(count, 0, sizeof(count));
for(int i = 1;i <= n;++i)
count[get_byte(arr1[i])]++;
index[0] = 1;
for(int i = 1;i < (1 << 8);++i)
index[i] = index[i - 1] + count[i - 1];
for(int i = 1;i <= n;++i)
arr2[index[get_byte(arr1[i])]++] = arr1[i];
}
void solve()
{
int *tmp = new int[n + 1];
for(int i = 0;i < 4;++i)
if(i & 1)
countsort(tmp, arr, i);
else
countsort(arr, tmp, i);
delete tmp;
for(int i = 1;i <= n;++i)
g<<arr[i]<<" ";
}
int main()
{
read();
solve();
return 0;
}