Cod sursa(job #781975)
Utilizator | Data | 25 august 2012 15:49:48 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500005],j,aux;
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
for(int i=2;i<=n;++i)
{
aux=v[i];
j=i;
while(j>1&&v[j-1]>aux)
{
v[j]=v[j-1];
--j;
}
v[j]=aux;
}
for(int i=1;i<=n;++i)
fout<<v[i]<<" ";
return 0;
}