Cod sursa(job #1524828)
| Utilizator | Data | 14 noiembrie 2015 14:38:21 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
void bucket_sort( long long v[], long long n)
{
int m=5000001;
int buckets[m];
for(int i=0; i<m; i++)
{
buckets[i]=0;
}
for(int i=0; i<n; i++ )
{
buckets[v[i]]++;
}
for(int i=0, j=0; j<m; j++ )
{
for(int k=buckets[j]; k>0; k--)
{
v[i++]=j;
}
}
}
int main()
{
long long n, i, v[5000001];
in>>n;
for( i=0; i<n; i++)
{
in>>v[i];
}
bucket_sort( v, n);
for( i=0; i<n; i++)
{
out<<v[i]<<' ';
}
return 0;
}
