Pagini recente » Cod sursa (job #1077583) | Cod sursa (job #377897) | Cod sursa (job #2086959) | Cod sursa (job #1054752) | Cod sursa (job #1020801)
# include <fstream>
# define dim 500000
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[dim],N;
int v1[dim],k[dim];
void swap1( int &x , int &y )
{
int aux;
aux = x;
x = y;
y = aux;
}
void algsort()
{
// numarare
int i,j;
for( i = 0 ; i < N-1; ++i )
for( j = i+1 ; j < N ; ++j )
if( v[i] > v[j] )
++k[i];
else ++k[j];
for( i = 0 ; i < N ; ++i )
v1[k[i]] = v[i];
}
int main(){
int i;
fin >> N;
for( i = 0 ; i < N ; ++i )
fin >> v[i];
algsort();
for( i = 0 ; i < N ; ++i )
fout << v1[i] << ' ';
fin.close();
fout.close();
return 0;
}