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